./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfef9e0cd5324afc9386a78468bea49ee605e5037c2d685b322567d67d524bb4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:54:55,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:54:55,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:54:55,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:54:55,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:54:55,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:54:55,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:54:55,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:54:55,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:54:55,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:54:55,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:54:55,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:54:55,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:54:55,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:54:55,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:54:55,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:54:55,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:54:55,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:54:55,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:54:55,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:54:55,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:54:55,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:54:55,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:54:55,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:54:55,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:54:55,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:54:55,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:54:55,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:54:55,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:54:55,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:54:55,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:54:55,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:54:55,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:55,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:54:55,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:54:55,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:54:55,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:54:55,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:54:55,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:54:55,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:54:55,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:54:55,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:54:55,726 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfef9e0cd5324afc9386a78468bea49ee605e5037c2d685b322567d67d524bb4 [2024-11-09 00:54:55,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:54:55,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:54:55,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:54:55,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:54:55,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:54:55,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i [2024-11-09 00:54:57,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:54:57,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:54:57,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i [2024-11-09 00:54:57,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6077ac38/5e10af5d18144614b379c2f6b00e59ab/FLAGa27d0fa49 [2024-11-09 00:54:57,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6077ac38/5e10af5d18144614b379c2f6b00e59ab [2024-11-09 00:54:57,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:54:57,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:54:57,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:57,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:54:57,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:54:57,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:57,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593da237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57, skipping insertion in model container [2024-11-09 00:54:57,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:57,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:54:57,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i[915,928] [2024-11-09 00:54:57,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:57,888 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:54:57,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i[915,928] [2024-11-09 00:54:57,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:57,936 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:54:57,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57 WrapperNode [2024-11-09 00:54:57,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:57,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:57,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:54:57,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:54:57,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:57,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,000 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-09 00:54:58,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:58,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:54:58,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:54:58,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:54:58,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,033 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:54:58,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:54:58,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:54:58,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:54:58,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:54:58,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (1/1) ... [2024-11-09 00:54:58,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:58,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:54:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:54:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:54:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:54:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:54:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:54:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:54:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:54:58,232 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:54:58,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:54:58,522 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 00:54:58,522 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:54:58,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:54:58,536 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:54:58,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:58 BoogieIcfgContainer [2024-11-09 00:54:58,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:54:58,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:54:58,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:54:58,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:54:58,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:54:57" (1/3) ... [2024-11-09 00:54:58,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c9c72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:58, skipping insertion in model container [2024-11-09 00:54:58,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:57" (2/3) ... [2024-11-09 00:54:58,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c9c72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:58, skipping insertion in model container [2024-11-09 00:54:58,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:58" (3/3) ... [2024-11-09 00:54:58,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-86.i [2024-11-09 00:54:58,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:54:58,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:54:58,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:54:58,620 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7460c85f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:54:58,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:54:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:54:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:54:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:58,635 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:58,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1174992419, now seen corresponding path program 1 times [2024-11-09 00:54:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:58,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299646823] [2024-11-09 00:54:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:54:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:54:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:54:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:54:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:54:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:54:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:54:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:54:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:54:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:54:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:54:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:54:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:54:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:54:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:54:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:54:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:54:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:54:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:54:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299646823] [2024-11-09 00:54:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299646823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:59,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:54:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662734951] [2024-11-09 00:54:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:59,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:54:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:54:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:54:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:59,121 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:54:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:59,141 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-09 00:54:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:54:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-09 00:54:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:59,151 INFO L225 Difference]: With dead ends: 95 [2024-11-09 00:54:59,152 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 00:54:59,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:59,162 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:59,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:54:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 00:54:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 00:54:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:54:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-09 00:54:59,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2024-11-09 00:54:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:59,208 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-09 00:54:59,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:54:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-09 00:54:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:54:59,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:59,212 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:59,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:54:59,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:59,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash 510743009, now seen corresponding path program 1 times [2024-11-09 00:54:59,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028970138] [2024-11-09 00:54:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:01,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:01,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028970138] [2024-11-09 00:55:01,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028970138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:01,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:01,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:55:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732728078] [2024-11-09 00:55:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:01,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:55:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:55:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:55:01,628 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:01,939 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2024-11-09 00:55:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:55:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-09 00:55:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:01,943 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:55:01,944 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 00:55:01,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:55:01,945 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 25 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:01,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 240 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:55:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 00:55:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-11-09 00:55:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:55:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-09 00:55:01,964 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 108 [2024-11-09 00:55:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:01,966 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-09 00:55:01,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-09 00:55:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:55:01,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:01,970 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:01,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:55:01,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:01,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash 512590051, now seen corresponding path program 1 times [2024-11-09 00:55:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395034843] [2024-11-09 00:55:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395034843] [2024-11-09 00:55:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395034843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:02,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:55:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339966538] [2024-11-09 00:55:02,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:55:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:55:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:55:02,854 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:55:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:03,045 INFO L93 Difference]: Finished difference Result 195 states and 282 transitions. [2024-11-09 00:55:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:55:03,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-09 00:55:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:03,048 INFO L225 Difference]: With dead ends: 195 [2024-11-09 00:55:03,049 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 00:55:03,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:55:03,051 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 99 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:03,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 158 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:55:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 00:55:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2024-11-09 00:55:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 states have internal predecessors, (109), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:55:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 199 transitions. [2024-11-09 00:55:03,099 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 199 transitions. Word has length 108 [2024-11-09 00:55:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:03,099 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 199 transitions. [2024-11-09 00:55:03,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:55:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 199 transitions. [2024-11-09 00:55:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:55:03,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:03,103 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:03,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:55:03,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 569848353, now seen corresponding path program 1 times [2024-11-09 00:55:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000891888] [2024-11-09 00:55:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000891888] [2024-11-09 00:55:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000891888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:55:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375891256] [2024-11-09 00:55:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:05,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:55:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:55:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:55:05,793 INFO L87 Difference]: Start difference. First operand 137 states and 199 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:06,217 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2024-11-09 00:55:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:55:06,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-09 00:55:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:06,221 INFO L225 Difference]: With dead ends: 188 [2024-11-09 00:55:06,221 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 00:55:06,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:55:06,223 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:06,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 224 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:55:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 00:55:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2024-11-09 00:55:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.263157894736842) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:55:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-09 00:55:06,248 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 108 [2024-11-09 00:55:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:06,251 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-09 00:55:06,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-09 00:55:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:55:06,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:06,253 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:06,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:55:06,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:06,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 174974301, now seen corresponding path program 1 times [2024-11-09 00:55:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019693983] [2024-11-09 00:55:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:08,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019693983] [2024-11-09 00:55:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019693983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:08,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:08,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 00:55:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932388708] [2024-11-09 00:55:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:08,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:55:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:55:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:55:08,975 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:09,474 INFO L93 Difference]: Finished difference Result 157 states and 222 transitions. [2024-11-09 00:55:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:55:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-09 00:55:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:09,477 INFO L225 Difference]: With dead ends: 157 [2024-11-09 00:55:09,477 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 00:55:09,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:55:09,479 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 32 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:09,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 294 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:55:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 00:55:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2024-11-09 00:55:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:55:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-09 00:55:09,497 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 108 [2024-11-09 00:55:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:09,497 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-09 00:55:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-09 00:55:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 00:55:09,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:09,499 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:09,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:55:09,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1924915025, now seen corresponding path program 1 times [2024-11-09 00:55:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139134994] [2024-11-09 00:55:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139134994] [2024-11-09 00:55:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139134994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:55:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818503193] [2024-11-09 00:55:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:09,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:55:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:55:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:55:09,579 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:09,623 INFO L93 Difference]: Finished difference Result 366 states and 534 transitions. [2024-11-09 00:55:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:55:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-09 00:55:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:09,626 INFO L225 Difference]: With dead ends: 366 [2024-11-09 00:55:09,626 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 00:55:09,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:55:09,628 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:09,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:55:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 00:55:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2024-11-09 00:55:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 142 states have (on average 1.1619718309859155) internal successors, (165), 144 states have internal predecessors, (165), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-09 00:55:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 345 transitions. [2024-11-09 00:55:09,672 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 345 transitions. Word has length 109 [2024-11-09 00:55:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:09,673 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 345 transitions. [2024-11-09 00:55:09,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 345 transitions. [2024-11-09 00:55:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 00:55:09,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:09,674 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:09,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:55:09,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:09,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1923067983, now seen corresponding path program 1 times [2024-11-09 00:55:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:09,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446343329] [2024-11-09 00:55:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446343329] [2024-11-09 00:55:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446343329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:55:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766831757] [2024-11-09 00:55:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:55:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:55:10,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:55:10,630 INFO L87 Difference]: Start difference. First operand 239 states and 345 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:11,098 INFO L93 Difference]: Finished difference Result 597 states and 852 transitions. [2024-11-09 00:55:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:55:11,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-09 00:55:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:11,102 INFO L225 Difference]: With dead ends: 597 [2024-11-09 00:55:11,102 INFO L226 Difference]: Without dead ends: 444 [2024-11-09 00:55:11,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:55:11,104 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:11,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 225 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:55:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-09 00:55:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 334. [2024-11-09 00:55:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 193 states have (on average 1.1347150259067358) internal successors, (219), 199 states have internal predecessors, (219), 130 states have call successors, (130), 10 states have call predecessors, (130), 10 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-09 00:55:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 479 transitions. [2024-11-09 00:55:11,155 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 479 transitions. Word has length 109 [2024-11-09 00:55:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:11,155 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 479 transitions. [2024-11-09 00:55:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 479 transitions. [2024-11-09 00:55:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 00:55:11,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:11,158 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:11,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:55:11,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1222003405, now seen corresponding path program 1 times [2024-11-09 00:55:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:11,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616266274] [2024-11-09 00:55:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:55:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616266274] [2024-11-09 00:55:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616266274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:11,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:55:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916855721] [2024-11-09 00:55:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:55:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:11,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:55:11,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:55:11,304 INFO L87 Difference]: Start difference. First operand 334 states and 479 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:11,356 INFO L93 Difference]: Finished difference Result 696 states and 999 transitions. [2024-11-09 00:55:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:55:11,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-09 00:55:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:11,360 INFO L225 Difference]: With dead ends: 696 [2024-11-09 00:55:11,360 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 00:55:11,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:55:11,362 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:11,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:55:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 00:55:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-09 00:55:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 221 states have (on average 1.1266968325791855) internal successors, (249), 227 states have internal predecessors, (249), 149 states have call successors, (149), 12 states have call predecessors, (149), 12 states have return successors, (149), 143 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-09 00:55:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 547 transitions. [2024-11-09 00:55:11,415 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 547 transitions. Word has length 109 [2024-11-09 00:55:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:11,416 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 547 transitions. [2024-11-09 00:55:11,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 547 transitions. [2024-11-09 00:55:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 00:55:11,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:11,420 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:11,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:55:11,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:11,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1805064430, now seen corresponding path program 1 times [2024-11-09 00:55:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:11,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517760526] [2024-11-09 00:55:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:55:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:55:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:55:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:55:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:55:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:55:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:55:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:55:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:55:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-09 00:55:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-09 00:55:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-09 00:55:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-09 00:55:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-09 00:55:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-09 00:55:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-09 00:55:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-09 00:55:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2024-11-09 00:55:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517760526] [2024-11-09 00:55:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517760526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 00:55:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947910613] [2024-11-09 00:55:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 00:55:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 00:55:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:55:13,952 INFO L87 Difference]: Start difference. First operand 383 states and 547 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:14,473 INFO L93 Difference]: Finished difference Result 396 states and 560 transitions. [2024-11-09 00:55:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 00:55:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 214 [2024-11-09 00:55:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:14,477 INFO L225 Difference]: With dead ends: 396 [2024-11-09 00:55:14,477 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 00:55:14,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:55:14,478 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 10 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:14,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 388 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:55:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 00:55:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 383. [2024-11-09 00:55:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 221 states have (on average 1.1176470588235294) internal successors, (247), 227 states have internal predecessors, (247), 149 states have call successors, (149), 12 states have call predecessors, (149), 12 states have return successors, (149), 143 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-09 00:55:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 545 transitions. [2024-11-09 00:55:14,534 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 545 transitions. Word has length 214 [2024-11-09 00:55:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:14,535 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 545 transitions. [2024-11-09 00:55:14,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 545 transitions. [2024-11-09 00:55:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:55:14,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:14,538 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:14,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:55:14,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:14,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2028643230, now seen corresponding path program 1 times [2024-11-09 00:55:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:14,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546153172] [2024-11-09 00:55:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:55:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:55:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:55:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:55:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:55:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:55:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:55:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:55:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:55:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:55:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:55:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:55:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:55:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:55:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:55:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:55:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:55:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:55:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:55:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:55:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:55:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:55:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:55:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-09 00:55:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-09 00:55:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-09 00:55:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-09 00:55:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-09 00:55:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-09 00:55:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-09 00:55:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-09 00:55:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [2024-11-09 00:55:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546153172] [2024-11-09 00:55:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546153172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:55:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497933977] [2024-11-09 00:55:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:55:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:55:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:55:14,652 INFO L87 Difference]: Start difference. First operand 383 states and 545 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:14,710 INFO L93 Difference]: Finished difference Result 695 states and 994 transitions. [2024-11-09 00:55:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:55:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 215 [2024-11-09 00:55:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:14,713 INFO L225 Difference]: With dead ends: 695 [2024-11-09 00:55:14,713 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:55:14,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:55:14,715 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:55:14,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 128 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:55:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:55:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:55:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:55:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:55:14,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 215 [2024-11-09 00:55:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:14,717 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:55:14,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 00:55:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:55:14,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:55:14,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:55:14,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 00:55:14,726 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:55:14,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:55:15,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:55:15,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:55:15 BoogieIcfgContainer [2024-11-09 00:55:15,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:55:15,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:55:15,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:55:15,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:55:15,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:58" (3/4) ... [2024-11-09 00:55:15,628 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:55:15,632 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:55:15,638 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:55:15,638 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 00:55:15,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:55:15,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:55:15,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:55:15,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:55:15,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:55:15,736 INFO L158 Benchmark]: Toolchain (without parser) took 18093.93ms. Allocated memory was 174.1MB in the beginning and 406.8MB in the end (delta: 232.8MB). Free memory was 116.9MB in the beginning and 162.3MB in the end (delta: -45.4MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,736 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:55:15,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.22ms. Allocated memory is still 174.1MB. Free memory was 116.5MB in the beginning and 102.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.01ms. Allocated memory is still 174.1MB. Free memory was 102.3MB in the beginning and 99.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,737 INFO L158 Benchmark]: Boogie Preprocessor took 49.52ms. Allocated memory is still 174.1MB. Free memory was 99.0MB in the beginning and 93.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,737 INFO L158 Benchmark]: RCFGBuilder took 484.98ms. Allocated memory is still 174.1MB. Free memory was 93.5MB in the beginning and 74.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,738 INFO L158 Benchmark]: TraceAbstraction took 17085.84ms. Allocated memory was 174.1MB in the beginning and 406.8MB in the end (delta: 232.8MB). Free memory was 73.8MB in the beginning and 167.5MB in the end (delta: -93.7MB). Peak memory consumption was 176.3MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,738 INFO L158 Benchmark]: Witness Printer took 109.91ms. Allocated memory is still 406.8MB. Free memory was 167.5MB in the beginning and 162.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:55:15,740 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.22ms. Allocated memory is still 174.1MB. Free memory was 116.5MB in the beginning and 102.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.01ms. Allocated memory is still 174.1MB. Free memory was 102.3MB in the beginning and 99.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.52ms. Allocated memory is still 174.1MB. Free memory was 99.0MB in the beginning and 93.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 484.98ms. Allocated memory is still 174.1MB. Free memory was 93.5MB in the beginning and 74.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17085.84ms. Allocated memory was 174.1MB in the beginning and 406.8MB in the end (delta: 232.8MB). Free memory was 73.8MB in the beginning and 167.5MB in the end (delta: -93.7MB). Peak memory consumption was 176.3MB. Max. memory is 16.1GB. * Witness Printer took 109.91ms. Allocated memory is still 406.8MB. Free memory was 167.5MB in the beginning and 162.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 10, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 2046 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1332 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 751 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 714 mSDtfsCounter, 751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 208 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 1296 NumberOfCodeBlocks, 1296 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 5278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 8913/8913 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((var_1_7 == var_1_1) && (var_1_13 <= ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)))) && (var_1_16 == 0)) && ((var_1_12 == 0) || (0 < (((var_1_7 * 4294967295) + var_1_13) % 4294967296)))) || ((((var_1_7 == var_1_1) && (var_1_13 <= ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)))) && ((var_1_12 == 0) || (0 < (((var_1_7 * 4294967295) + var_1_13) % 4294967296)))) && (((((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0)) && ((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1)))) && (((var_1_7 == var_1_11) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))))) || ((((4294967295 + var_1_13) % 4294967296) <= 4294967294) && ((var_1_18 == var_1_16) || (var_1_13 < (((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)) + 1))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:55:15,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE