/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 00:35:32,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 00:35:32,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 00:35:32,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 00:35:32,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 00:35:32,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 00:35:32,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 00:35:32,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 00:35:32,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 00:35:32,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 00:35:32,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 00:35:32,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 00:35:32,449 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 00:35:32,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 00:35:32,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 00:35:32,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 00:35:32,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 00:35:32,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 00:35:32,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 00:35:32,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 00:35:32,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 00:35:32,454 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 00:35:32,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 00:35:32,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 00:35:32,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 00:35:32,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 00:35:32,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 00:35:32,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-08 00:35:32,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 00:35:32,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 00:35:32,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 00:35:32,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 00:35:32,710 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 00:35:32,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-11.i [2024-05-08 00:35:33,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 00:35:34,084 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 00:35:34,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i [2024-05-08 00:35:34,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/71afc522d/cceb3c03239f4e6cbcf9f5fd60ddd04e/FLAG1378f637e [2024-05-08 00:35:34,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/71afc522d/cceb3c03239f4e6cbcf9f5fd60ddd04e [2024-05-08 00:35:34,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 00:35:34,118 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 00:35:34,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 00:35:34,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 00:35:34,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 00:35:34,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65dcf663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34, skipping insertion in model container [2024-05-08 00:35:34,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 00:35:34,485 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i[30243,30256] [2024-05-08 00:35:34,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 00:35:34,508 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 00:35:34,537 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i[30243,30256] [2024-05-08 00:35:34,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 00:35:34,572 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 00:35:34,572 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 00:35:34,578 INFO L206 MainTranslator]: Completed translation [2024-05-08 00:35:34,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34 WrapperNode [2024-05-08 00:35:34,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 00:35:34,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 00:35:34,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 00:35:34,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 00:35:34,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,623 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-05-08 00:35:34,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 00:35:34,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 00:35:34,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 00:35:34,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 00:35:34,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 00:35:34,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 00:35:34,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 00:35:34,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 00:35:34,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (1/1) ... [2024-05-08 00:35:34,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 00:35:34,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:34,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-08 00:35:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-08 00:35:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-08 00:35:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-08 00:35:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-08 00:35:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-08 00:35:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 00:35:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 00:35:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 00:35:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 00:35:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 00:35:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 00:35:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 00:35:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 00:35:34,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 00:35:34,771 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 00:35:34,904 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 00:35:34,905 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 00:35:35,092 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 00:35:35,103 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 00:35:35,103 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-08 00:35:35,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 12:35:35 BoogieIcfgContainer [2024-05-08 00:35:35,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 00:35:35,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 00:35:35,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 00:35:35,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 00:35:35,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 12:35:34" (1/3) ... [2024-05-08 00:35:35,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b708f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 12:35:35, skipping insertion in model container [2024-05-08 00:35:35,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:35:34" (2/3) ... [2024-05-08 00:35:35,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b708f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 12:35:35, skipping insertion in model container [2024-05-08 00:35:35,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 12:35:35" (3/3) ... [2024-05-08 00:35:35,112 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11.i [2024-05-08 00:35:35,119 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 00:35:35,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 00:35:35,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 00:35:35,127 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 00:35:35,169 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-08 00:35:35,220 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 00:35:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 00:35:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:35,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 00:35:35,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-08 00:35:35,303 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 00:35:35,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:35,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 00:35:35,317 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@4d03c4cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 00:35:35,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-08 00:35:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 920930900, now seen corresponding path program 1 times [2024-05-08 00:35:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:35,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1818823887, now seen corresponding path program 2 times [2024-05-08 00:35:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:35,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 310184287, now seen corresponding path program 1 times [2024-05-08 00:35:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:35,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2019539270, now seen corresponding path program 2 times [2024-05-08 00:35:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1361992354, now seen corresponding path program 1 times [2024-05-08 00:35:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1458873881, now seen corresponding path program 2 times [2024-05-08 00:35:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1246410695, now seen corresponding path program 1 times [2024-05-08 00:35:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1476962782, now seen corresponding path program 2 times [2024-05-08 00:35:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1832526146, now seen corresponding path program 1 times [2024-05-08 00:35:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2125856643, now seen corresponding path program 2 times [2024-05-08 00:35:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash -397354433, now seen corresponding path program 1 times [2024-05-08 00:35:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1038408806, now seen corresponding path program 2 times [2024-05-08 00:35:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:36,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1184059601, now seen corresponding path program 1 times [2024-05-08 00:35:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367443942] [2024-05-08 00:35:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:36,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367443942] [2024-05-08 00:35:36,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367443942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:35:36,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 00:35:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 00:35:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103628360] [2024-05-08 00:35:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:35:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 00:35:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 00:35:36,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 00:35:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:36,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:36,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-05-08 00:35:36,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash 227468881, now seen corresponding path program 1 times [2024-05-08 00:35:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash -317715180, now seen corresponding path program 2 times [2024-05-08 00:35:36,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:36,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:36,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash -394829268, now seen corresponding path program 3 times [2024-05-08 00:35:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1513772121, now seen corresponding path program 4 times [2024-05-08 00:35:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2108893497, now seen corresponding path program 5 times [2024-05-08 00:35:37,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1018665260, now seen corresponding path program 6 times [2024-05-08 00:35:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1998895504, now seen corresponding path program 7 times [2024-05-08 00:35:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1075515787, now seen corresponding path program 8 times [2024-05-08 00:35:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash 162201649, now seen corresponding path program 9 times [2024-05-08 00:35:37,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1350780724, now seen corresponding path program 10 times [2024-05-08 00:35:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:37,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-08 00:35:37,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:37,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 546730109, now seen corresponding path program 1 times [2024-05-08 00:35:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674117668] [2024-05-08 00:35:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674117668] [2024-05-08 00:35:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674117668] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:35:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71605965] [2024-05-08 00:35:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:37,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:37,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:35:37,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-08 00:35:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:37,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 00:35:37,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:35:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:37,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:35:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71605965] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 00:35:37,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 00:35:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 00:35:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870940549] [2024-05-08 00:35:37,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 00:35:37,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 00:35:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:37,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 00:35:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 00:35:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:37,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-05-08 00:35:37,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:37,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:37,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-08 00:35:38,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-05-08 00:35:38,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:38,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -872570179, now seen corresponding path program 2 times [2024-05-08 00:35:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128895215] [2024-05-08 00:35:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128895215] [2024-05-08 00:35:38,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128895215] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:35:38,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500694780] [2024-05-08 00:35:38,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 00:35:38,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:38,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:35:38,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-08 00:35:38,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 00:35:38,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 00:35:38,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 00:35:38,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:35:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:38,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:35:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500694780] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 00:35:38,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 00:35:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 00:35:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125294870] [2024-05-08 00:35:38,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 00:35:38,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 00:35:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 00:35:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 00:35:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:38,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:38,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.833333333333334) internal successors, (195), 18 states have internal predecessors, (195), 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-05-08 00:35:38,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:38,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:38,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:38,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-08 00:35:39,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-05-08 00:35:39,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:39,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash 328881981, now seen corresponding path program 3 times [2024-05-08 00:35:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422527740] [2024-05-08 00:35:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:39,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422527740] [2024-05-08 00:35:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422527740] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:35:39,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308138968] [2024-05-08 00:35:39,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 00:35:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:39,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:35:39,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-08 00:35:39,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-08 00:35:39,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 00:35:39,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-08 00:35:39,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:35:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:39,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:35:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308138968] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 00:35:40,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 00:35:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-05-08 00:35:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670952819] [2024-05-08 00:35:40,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 00:35:40,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-08 00:35:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-08 00:35:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-05-08 00:35:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:40,169 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:40,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.735294117647058) internal successors, (331), 34 states have internal predecessors, (331), 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-05-08 00:35:40,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:40,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:40,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:40,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:40,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-08 00:35:40,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:40,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:40,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 587006013, now seen corresponding path program 4 times [2024-05-08 00:35:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059599437] [2024-05-08 00:35:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 0 proven. 1950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059599437] [2024-05-08 00:35:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059599437] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:35:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726624760] [2024-05-08 00:35:41,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-08 00:35:41,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:41,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:41,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:35:41,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-08 00:35:41,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-08 00:35:41,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 00:35:41,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-08 00:35:41,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:35:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 1808 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-05-08 00:35:42,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-08 00:35:42,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726624760] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:35:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-08 00:35:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [33] total 56 [2024-05-08 00:35:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308206132] [2024-05-08 00:35:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:35:42,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-08 00:35:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-08 00:35:42,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2024-05-08 00:35:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:42,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:42,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.36) internal successors, (259), 25 states have internal predecessors, (259), 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-05-08 00:35:42,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:42,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:42,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:42,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:42,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:43,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-08 00:35:43,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-05-08 00:35:43,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:43,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1485968687, now seen corresponding path program 1 times [2024-05-08 00:35:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777843571] [2024-05-08 00:35:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 1636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777843571] [2024-05-08 00:35:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777843571] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:35:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177822614] [2024-05-08 00:35:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:44,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:35:44,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-08 00:35:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:44,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-08 00:35:44,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:35:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 1544 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-05-08 00:35:45,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-08 00:35:45,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177822614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:35:45,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-08 00:35:45,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [33] total 56 [2024-05-08 00:35:45,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580340486] [2024-05-08 00:35:45,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:35:45,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-08 00:35:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-08 00:35:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2024-05-08 00:35:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:45,148 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:45,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.28) internal successors, (257), 25 states have internal predecessors, (257), 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-05-08 00:35:45,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:45,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:45,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:45,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:45,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:45,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:45,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-08 00:35:45,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-05-08 00:35:45,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:45,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1233727651, now seen corresponding path program 1 times [2024-05-08 00:35:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118393209] [2024-05-08 00:35:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 1322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:35:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118393209] [2024-05-08 00:35:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118393209] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:35:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873054226] [2024-05-08 00:35:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:35:46,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:35:46,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:35:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-08 00:35:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:35:46,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-08 00:35:46,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:35:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 1322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:47,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:35:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 1322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:35:48,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873054226] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 00:35:48,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 00:35:48,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2024-05-08 00:35:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226592412] [2024-05-08 00:35:48,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 00:35:48,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-08 00:35:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:35:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-08 00:35:48,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2024-05-08 00:35:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:48,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:35:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 8.549019607843137) internal successors, (436), 51 states have internal predecessors, (436), 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-05-08 00:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:35:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:35:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 00:35:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 00:35:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-08 00:35:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-08 00:35:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-08 00:35:49,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-08 00:35:49,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-05-08 00:35:49,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:35:49,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:35:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1023018470, now seen corresponding path program 2 times [2024-05-08 00:35:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:35:49,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131284377] [2024-05-08 00:35:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:35:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:35:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:49,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:35:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:35:49,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 00:35:49,726 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 00:35:49,727 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-08 00:35:49,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-08 00:35:49,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-08 00:35:49,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-08 00:35:49,732 INFO L448 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2024-05-08 00:35:49,736 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 00:35:49,736 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 00:35:49,819 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2024-05-08 00:35:49,821 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2024-05-08 00:35:49,852 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2024-05-08 00:35:49,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 12:35:49 BasicIcfg [2024-05-08 00:35:49,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 00:35:49,877 INFO L158 Benchmark]: Toolchain (without parser) took 15759.51ms. Allocated memory was 221.2MB in the beginning and 612.4MB in the end (delta: 391.1MB). Free memory was 180.7MB in the beginning and 411.0MB in the end (delta: -230.3MB). Peak memory consumption was 160.2MB. Max. memory is 8.0GB. [2024-05-08 00:35:49,877 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory was 186.5MB in the beginning and 186.3MB in the end (delta: 150.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 00:35:49,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.78ms. Allocated memory was 221.2MB in the beginning and 341.8MB in the end (delta: 120.6MB). Free memory was 180.3MB in the beginning and 303.4MB in the end (delta: -123.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-08 00:35:49,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.81ms. Allocated memory is still 341.8MB. Free memory was 303.4MB in the beginning and 301.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 00:35:49,879 INFO L158 Benchmark]: Boogie Preprocessor took 28.37ms. Allocated memory is still 341.8MB. Free memory was 301.4MB in the beginning and 299.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 00:35:49,879 INFO L158 Benchmark]: RCFGBuilder took 451.80ms. Allocated memory is still 341.8MB. Free memory was 299.8MB in the beginning and 285.7MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-08 00:35:49,880 INFO L158 Benchmark]: TraceAbstraction took 14770.28ms. Allocated memory was 341.8MB in the beginning and 612.4MB in the end (delta: 270.5MB). Free memory was 284.5MB in the beginning and 411.0MB in the end (delta: -126.5MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. [2024-05-08 00:35:49,880 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.09ms. Allocated memory is still 221.2MB. Free memory was 186.5MB in the beginning and 186.3MB in the end (delta: 150.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.78ms. Allocated memory was 221.2MB in the beginning and 341.8MB in the end (delta: 120.6MB). Free memory was 180.3MB in the beginning and 303.4MB in the end (delta: -123.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.81ms. Allocated memory is still 341.8MB. Free memory was 303.4MB in the beginning and 301.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.37ms. Allocated memory is still 341.8MB. Free memory was 301.4MB in the beginning and 299.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.80ms. Allocated memory is still 341.8MB. Free memory was 299.8MB in the beginning and 285.7MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14770.28ms. Allocated memory was 341.8MB in the beginning and 612.4MB in the end (delta: 270.5MB). Free memory was 284.5MB in the beginning and 411.0MB in the end (delta: -126.5MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 39417, independent: 36466, independent conditional: 30236, independent unconditional: 6230, dependent: 2951, dependent conditional: 2929, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36510, independent: 36466, independent conditional: 30236, independent unconditional: 6230, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36510, independent: 36466, independent conditional: 30236, independent unconditional: 6230, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36510, independent: 36466, independent conditional: 30236, independent unconditional: 6230, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36564, independent: 36466, independent conditional: 13796, independent unconditional: 22670, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36564, independent: 36466, independent conditional: 9102, independent unconditional: 27364, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36564, independent: 36466, independent conditional: 9102, independent unconditional: 27364, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 599, independent: 597, independent conditional: 4, independent unconditional: 593, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 599, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 36564, independent: 35869, independent conditional: 9098, independent unconditional: 26771, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 599, unknown conditional: 4, unknown unconditional: 595] , Statistics on independence cache: Total cache size (in pairs): 599, Positive cache size: 597, Positive conditional cache size: 4, Positive unconditional cache size: 593, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4704, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36564, independent: 36466, independent conditional: 13796, independent unconditional: 22670, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36564, independent: 36466, independent conditional: 9102, independent unconditional: 27364, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36564, independent: 36466, independent conditional: 9102, independent unconditional: 27364, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 599, independent: 597, independent conditional: 4, independent unconditional: 593, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 599, independent: 597, independent conditional: 0, independent unconditional: 597, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 36564, independent: 35869, independent conditional: 9098, independent unconditional: 26771, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 599, unknown conditional: 4, unknown unconditional: 595] , Statistics on independence cache: Total cache size (in pairs): 599, Positive cache size: 597, Positive conditional cache size: 4, Positive unconditional cache size: 593, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4704 ], Independence queries for same thread: 2907 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; VAL [i=0, j=0] [L685] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L702] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L703] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L713] 0 pthread_t id1, id2; VAL [\old(argc)=75026, argc=75026, argv={75027:75028}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=75026, argc=75026, argv={75027:75028}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=75026, argc=75026, argv={75027:75028}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=75026, arg={0:0}, argc=75026, argv={75027:75028}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=0, q=1, x=0] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=1, q=3, x=2] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=2, q=4, x=3] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=3, q=5, x=4] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=13, p=6, prev=5, q=6, x=5] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=13, p=6, prev=8, q=6, x=5] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=5] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=21, p=7, prev=8, q=7, x=6] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=21, p=7, prev=13, q=7, x=6] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=6] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=7, x=7] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=8, x=7] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=8, x=7] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=34, p=8, prev=13, q=8, x=7] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=7] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=7] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=8, x=8] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=9, x=8] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=9, x=8] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=55, p=9, prev=21, q=9, x=8] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=8] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=8] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=9, x=9] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=10, x=9] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=10, x=9] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=89, p=10, prev=34, q=10, x=9] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=9] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=9] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L695] COND TRUE 2 q < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=10, x=10] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=11, x=10] [L705] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=11, x=10] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=144, p=11, prev=55, q=11, x=10] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=10] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=10] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L687] COND FALSE 1 !(p < 11) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L692] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L695] COND FALSE 2 !(q < 11) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L700] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=233, p=11, prev=89, q=11, x=11] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=11] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=11] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=12] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=12] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=377, p=11, prev=144, q=11, x=12] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=377, p=11, prev=233, q=11, x=12] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=28657, j=46368, next=377, p=11, prev=233, q=11, x=12] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=28657, j=46368, next=377, p=11, prev=233, q=11, x=13] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=28657, j=46368, next=377, p=11, prev=233, q=11, x=13] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=28657, j=46368, next=610, p=11, prev=233, q=11, x=13] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=28657, j=46368, next=610, p=11, prev=377, q=11, x=13] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=28657, j=46368, next=610, p=11, prev=377, q=11, x=13] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=28657, j=46368, next=610, p=11, prev=377, q=11, x=14] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=28657, j=46368, next=610, p=11, prev=377, q=11, x=14] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=28657, j=46368, next=987, p=11, prev=377, q=11, x=14] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=28657, j=46368, next=987, p=11, prev=610, q=11, x=14] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=28657, j=46368, next=987, p=11, prev=610, q=11, x=14] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=28657, j=46368, next=987, p=11, prev=610, q=11, x=15] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=28657, j=46368, next=987, p=11, prev=610, q=11, x=15] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=28657, j=46368, next=1597, p=11, prev=610, q=11, x=15] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=28657, j=46368, next=1597, p=11, prev=987, q=11, x=15] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=28657, j=46368, next=1597, p=11, prev=987, q=11, x=15] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=28657, j=46368, next=1597, p=11, prev=987, q=11, x=16] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=28657, j=46368, next=1597, p=11, prev=987, q=11, x=16] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=28657, j=46368, next=2584, p=11, prev=987, q=11, x=16] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=28657, j=46368, next=2584, p=11, prev=1597, q=11, x=16] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=28657, j=46368, next=2584, p=11, prev=1597, q=11, x=16] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=28657, j=46368, next=2584, p=11, prev=1597, q=11, x=17] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=28657, j=46368, next=2584, p=11, prev=1597, q=11, x=17] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=28657, j=46368, next=4181, p=11, prev=1597, q=11, x=17] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=28657, j=46368, next=4181, p=11, prev=2584, q=11, x=17] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=28657, j=46368, next=4181, p=11, prev=2584, q=11, x=17] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=28657, j=46368, next=4181, p=11, prev=2584, q=11, x=18] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=28657, j=46368, next=4181, p=11, prev=2584, q=11, x=18] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=28657, j=46368, next=6765, p=11, prev=2584, q=11, x=18] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=28657, j=46368, next=6765, p=11, prev=4181, q=11, x=18] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=28657, j=46368, next=6765, p=11, prev=4181, q=11, x=18] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=28657, j=46368, next=6765, p=11, prev=4181, q=11, x=19] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=28657, j=46368, next=6765, p=11, prev=4181, q=11, x=19] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=28657, j=46368, next=10946, p=11, prev=4181, q=11, x=19] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=28657, j=46368, next=10946, p=11, prev=6765, q=11, x=19] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=28657, j=46368, next=10946, p=11, prev=6765, q=11, x=19] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=28657, j=46368, next=10946, p=11, prev=6765, q=11, x=20] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=28657, j=46368, next=10946, p=11, prev=6765, q=11, x=20] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=28657, j=46368, next=17711, p=11, prev=6765, q=11, x=20] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=28657, j=46368, next=17711, p=11, prev=10946, q=11, x=20] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=28657, j=46368, next=17711, p=11, prev=10946, q=11, x=20] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=28657, j=46368, next=17711, p=11, prev=10946, q=11, x=21] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=28657, j=46368, next=17711, p=11, prev=10946, q=11, x=21] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=28657, j=46368, next=28657, p=11, prev=10946, q=11, x=21] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=28657, j=46368, next=28657, p=11, prev=17711, q=11, x=21] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=28657, j=46368, next=28657, p=11, prev=17711, q=11, x=21] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=28657, j=46368, next=28657, p=11, prev=17711, q=11, x=22] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=28657, j=46368, next=28657, p=11, prev=17711, q=11, x=22] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=28657, j=46368, next=46368, p=11, prev=17711, q=11, x=22] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=28657, j=46368, next=46368, p=11, prev=28657, q=11, x=22] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=28657, j=46368, next=46368, p=11, prev=28657, q=11, x=22] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=28657, j=46368, next=46368, p=11, prev=28657, q=11, x=23] [L705] COND TRUE 0 x < 24 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=28657, j=46368, next=46368, p=11, prev=28657, q=11, x=23] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=28657, j=46368, next=75025, p=11, prev=28657, q=11, x=23] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=23] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=23] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L705] COND FALSE 0 !(x < 24) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L710] 0 return prev; VAL [\result=46368, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); VAL [\old(argc)=75026, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, correct=46368, cur=75025, i=28657, id1={5:0}, id2={3:0}, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=75026, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, assert_cond=0, correct=46368, cur=75025, i=28657, id1={5:0}, id2={3:0}, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, expression=0, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, expression=0, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 5.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2942 NumberOfCodeBlocks, 2942 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3241 ConstructedInterpolants, 0 QuantifiedInterpolants, 7729 SizeOfPredicates, 96 NumberOfNonLiveVariables, 2438 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 3586/12725 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, ConditionalCommutativityCheckTime: 1.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 22, ConditionalCommutativityTraceChecks: 22, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-08 00:35:49,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-08 00:35:50,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...