/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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 13:50:33,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 13:50:33,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 13:50:33,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 13:50:33,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 13:50:33,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 13:50:33,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 13:50:33,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 13:50:33,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 13:50:33,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 13:50:33,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 13:50:33,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 13:50:33,369 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 13:50:33,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 13:50:33,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 13:50:33,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 13:50:33,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 13:50:33,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 13:50:33,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 13:50:33,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 13:50:33,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 13:50:33,373 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 13:50:33,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 13:50:33,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:50:33,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 13:50:33,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 13:50:33,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 13:50:33,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 13:50:33,375 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 13:50:33,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 13:50:33,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 13:50:33,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 13:50:33,375 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 13:50:33,375 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT 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 -> 50 [2024-05-06 13:50:33,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 13:50:33,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 13:50:33,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 13:50:33,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 13:50:33,604 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 13:50:33,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-05-06 13:50:34,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 13:50:34,866 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 13:50:34,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-05-06 13:50:34,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0e1903f57/162ebcab04e04751889871a126536d78/FLAG15cfa8970 [2024-05-06 13:50:34,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0e1903f57/162ebcab04e04751889871a126536d78 [2024-05-06 13:50:34,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 13:50:34,898 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 13:50:34,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 13:50:34,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 13:50:34,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 13:50:34,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:50:34" (1/1) ... [2024-05-06 13:50:34,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2472331e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:34, skipping insertion in model container [2024-05-06 13:50:34,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:50:34" (1/1) ... [2024-05-06 13:50:34,951 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 13:50:35,070 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-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-06 13:50:35,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:50:35,280 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 13:50:35,290 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-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-06 13:50:35,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:50:35,356 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:50:35,356 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:50:35,362 INFO L206 MainTranslator]: Completed translation [2024-05-06 13:50:35,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35 WrapperNode [2024-05-06 13:50:35,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 13:50:35,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 13:50:35,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 13:50:35,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 13:50:35,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,424 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-05-06 13:50:35,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 13:50:35,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 13:50:35,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 13:50:35,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 13:50:35,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 13:50:35,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 13:50:35,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 13:50:35,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 13:50:35,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (1/1) ... [2024-05-06 13:50:35,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:50:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:50:35,509 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-06 13:50:35,527 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-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 13:50:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 13:50:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 13:50:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 13:50:35,547 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 13:50:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 13:50:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 13:50:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 13:50:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 13:50:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 13:50:35,549 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 13:50:35,668 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 13:50:35,670 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 13:50:35,890 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 13:50:35,997 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 13:50:35,997 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 13:50:35,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:50:35 BoogieIcfgContainer [2024-05-06 13:50:35,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 13:50:36,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 13:50:36,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 13:50:36,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 13:50:36,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:50:34" (1/3) ... [2024-05-06 13:50:36,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e14c487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:50:36, skipping insertion in model container [2024-05-06 13:50:36,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:35" (2/3) ... [2024-05-06 13:50:36,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e14c487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:50:36, skipping insertion in model container [2024-05-06 13:50:36,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:50:35" (3/3) ... [2024-05-06 13:50:36,007 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-05-06 13:50:36,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 13:50:36,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 13:50:36,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 13:50:36,026 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 13:50:36,075 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 13:50:36,120 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 13:50:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 13:50:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:50:36,141 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-06 13:50:36,161 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-06 13:50:36,198 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 13:50:36,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:36,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 13:50:36,217 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;@74556a8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 13:50:36,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 13:50:36,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:50:36,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:36,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1910670578, now seen corresponding path program 1 times [2024-05-06 13:50:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357993124] [2024-05-06 13:50:36,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:36,607 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-06 13:50:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357993124] [2024-05-06 13:50:36,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357993124] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:36,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 13:50:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913644380] [2024-05-06 13:50:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:36,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 13:50:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:36,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 13:50:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 13:50:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:36,631 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:36,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 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-06 13:50:36,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:36,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 13:50:36,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:50:36,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2036727232, now seen corresponding path program 1 times [2024-05-06 13:50:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041203255] [2024-05-06 13:50:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:37,483 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-06 13:50:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041203255] [2024-05-06 13:50:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041203255] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:37,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 13:50:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142484405] [2024-05-06 13:50:37,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:37,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 13:50:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 13:50:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-06 13:50:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:37,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:37,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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-06 13:50:37,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:37,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 13:50:37,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:50:37,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1498932359, now seen corresponding path program 1 times [2024-05-06 13:50:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674280255] [2024-05-06 13:50:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:37,887 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-06 13:50:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674280255] [2024-05-06 13:50:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674280255] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 13:50:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547764385] [2024-05-06 13:50:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:37,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 13:50:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 13:50:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 13:50:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:37,890 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:37,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-06 13:50:37,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:37,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:37,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 213122830, now seen corresponding path program 1 times [2024-05-06 13:50:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:38,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:50:38,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-05-06 13:50:38,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:50:38,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash -894903573, now seen corresponding path program 1 times [2024-05-06 13:50:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270630842] [2024-05-06 13:50:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:38,560 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-06 13:50:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270630842] [2024-05-06 13:50:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270630842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 13:50:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41621785] [2024-05-06 13:50:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:38,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 13:50:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 13:50:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 13:50:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:38,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:38,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-06 13:50:38,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:38,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:38,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:50:38,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash 213122830, now seen corresponding path program 2 times [2024-05-06 13:50:38,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:38,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 133580893, now seen corresponding path program 1 times [2024-05-06 13:50:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:39,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2057113139, now seen corresponding path program 1 times [2024-05-06 13:50:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:39,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1434473287, now seen corresponding path program 1 times [2024-05-06 13:50:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:47,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash -646407539, now seen corresponding path program 1 times [2024-05-06 13:50:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:54,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1364667645, now seen corresponding path program 1 times [2024-05-06 13:51:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:01,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash 321213314, now seen corresponding path program 1 times [2024-05-06 13:51:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:07,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash 426042208, now seen corresponding path program 1 times [2024-05-06 13:51:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:13,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1260676065, now seen corresponding path program 1 times [2024-05-06 13:51:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1723777871, now seen corresponding path program 2 times [2024-05-06 13:51:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1897506083, now seen corresponding path program 2 times [2024-05-06 13:51:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1306853938, now seen corresponding path program 3 times [2024-05-06 13:51:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:51:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:51:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 13:51:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 13:51:21,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-06 13:51:21,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:51:21,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:51:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1333046087, now seen corresponding path program 2 times [2024-05-06 13:51:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:51:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44552966] [2024-05-06 13:51:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:51:21,773 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-06 13:51:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:51:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44552966] [2024-05-06 13:51:21,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44552966] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:51:21,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:51:21,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 13:51:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774701397] [2024-05-06 13:51:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:51:21,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 13:51:21,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:51:21,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 13:51:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 13:51:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:51:21,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:51:21,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-06 13:51:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:51:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:51:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 13:51:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 13:51:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:51:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 213122830, now seen corresponding path program 4 times [2024-05-06 13:51:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 133580893, now seen corresponding path program 3 times [2024-05-06 13:51:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:22,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2057113139, now seen corresponding path program 3 times [2024-05-06 13:51:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:22,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1434473287, now seen corresponding path program 2 times [2024-05-06 13:51:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:28,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -646407539, now seen corresponding path program 2 times [2024-05-06 13:51:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:34,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1364667645, now seen corresponding path program 2 times [2024-05-06 13:51:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:40,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 321213314, now seen corresponding path program 2 times [2024-05-06 13:51:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:46,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash 426042208, now seen corresponding path program 2 times [2024-05-06 13:51:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1260676065, now seen corresponding path program 2 times [2024-05-06 13:51:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1723777871, now seen corresponding path program 4 times [2024-05-06 13:51:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1897506083, now seen corresponding path program 4 times [2024-05-06 13:51:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1306853938, now seen corresponding path program 5 times [2024-05-06 13:51:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:58,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash -652049458, now seen corresponding path program 1 times [2024-05-06 13:52:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:04,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1780173772, now seen corresponding path program 1 times [2024-05-06 13:52:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash 257102867, now seen corresponding path program 1 times [2024-05-06 13:52:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 273546936, now seen corresponding path program 1 times [2024-05-06 13:52:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1549632530, now seen corresponding path program 1 times [2024-05-06 13:52:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1574439330, now seen corresponding path program 1 times [2024-05-06 13:52:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:17,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1334629166, now seen corresponding path program 1 times [2024-05-06 13:52:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:23,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2035203608, now seen corresponding path program 1 times [2024-05-06 13:52:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:30,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1035580167, now seen corresponding path program 1 times [2024-05-06 13:52:36,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:36,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:36,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash -659292357, now seen corresponding path program 1 times [2024-05-06 13:52:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:41,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1545281370, now seen corresponding path program 1 times [2024-05-06 13:52:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1882967798, now seen corresponding path program 2 times [2024-05-06 13:52:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1757540040, now seen corresponding path program 2 times [2024-05-06 13:52:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:47,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1350833975, now seen corresponding path program 2 times [2024-05-06 13:52:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:47,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1850942871, now seen corresponding path program 1 times [2024-05-06 13:52:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:53,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -336710191, now seen corresponding path program 1 times [2024-05-06 13:52:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 608419823, now seen corresponding path program 1 times [2024-05-06 13:52:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -823498916, now seen corresponding path program 1 times [2024-05-06 13:52:59,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:59,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1375696622, now seen corresponding path program 1 times [2024-05-06 13:53:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 477393478, now seen corresponding path program 1 times [2024-05-06 13:53:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:08,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1508565074, now seen corresponding path program 1 times [2024-05-06 13:53:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:14,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1752498108, now seen corresponding path program 1 times [2024-05-06 13:53:20,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:20,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:20,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1303555299, now seen corresponding path program 1 times [2024-05-06 13:53:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:25,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:31,859 INFO L85 PathProgramCache]: Analyzing trace with hash 319183327, now seen corresponding path program 1 times [2024-05-06 13:53:31,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:31,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1236622974, now seen corresponding path program 1 times [2024-05-06 13:53:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:38,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1709031890, now seen corresponding path program 2 times [2024-05-06 13:53:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:38,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1440381404, now seen corresponding path program 2 times [2024-05-06 13:53:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:38,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -178418163, now seen corresponding path program 1 times [2024-05-06 13:53:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:44,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1933999533, now seen corresponding path program 1 times [2024-05-06 13:53:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:50,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -105366655, now seen corresponding path program 1 times [2024-05-06 13:53:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:57,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1659224851, now seen corresponding path program 1 times [2024-05-06 13:54:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:03,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1023400887, now seen corresponding path program 1 times [2024-05-06 13:54:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:10,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash -659626616, now seen corresponding path program 1 times [2024-05-06 13:54:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:15,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash 117307546, now seen corresponding path program 1 times [2024-05-06 13:54:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:22,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1943453543, now seen corresponding path program 1 times [2024-05-06 13:54:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:28,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:35,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1586732936, now seen corresponding path program 1 times [2024-05-06 13:54:35,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:35,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:35,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash 882561234, now seen corresponding path program 1 times [2024-05-06 13:54:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:40,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash -143304917, now seen corresponding path program 1 times [2024-05-06 13:54:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:54:45,752 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-06 13:54:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:54:45,801 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-06 13:54:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:54:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-06 13:54:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1434473287, now seen corresponding path program 3 times [2024-05-06 13:54:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:51,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash -646407539, now seen corresponding path program 3 times [2024-05-06 13:54:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:57,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1364667645, now seen corresponding path program 3 times [2024-05-06 13:55:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:03,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 321213314, now seen corresponding path program 3 times [2024-05-06 13:55:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:08,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash 426042208, now seen corresponding path program 3 times [2024-05-06 13:55:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:15,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1260676065, now seen corresponding path program 3 times [2024-05-06 13:55:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:20,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -652049458, now seen corresponding path program 2 times [2024-05-06 13:55:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:26,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1780173772, now seen corresponding path program 2 times [2024-05-06 13:55:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:33,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1574439330, now seen corresponding path program 2 times [2024-05-06 13:55:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:38,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1334629166, now seen corresponding path program 2 times [2024-05-06 13:55:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:45,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2035203608, now seen corresponding path program 2 times [2024-05-06 13:55:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:51,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1035580167, now seen corresponding path program 2 times [2024-05-06 13:55:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:57,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -857719941, now seen corresponding path program 1 times [2024-05-06 13:56:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:56:03,434 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-06 13:56:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:56:03,491 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-06 13:56:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:56:03,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-05-06 13:56:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 364868604, now seen corresponding path program 1 times [2024-05-06 13:56:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:13,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -819458248, now seen corresponding path program 1 times [2024-05-06 13:56:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:16,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash -857671950, now seen corresponding path program 1 times [2024-05-06 13:56:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:56:19,538 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-06 13:56:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:56:19,580 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-06 13:56:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:56:19,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-05-06 13:59:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 428099877, now seen corresponding path program 1 times [2024-05-06 13:59:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:36,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1220478142, now seen corresponding path program 1 times [2024-05-06 13:59:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash 593561380, now seen corresponding path program 1 times [2024-05-06 13:59:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash -119398712, now seen corresponding path program 1 times [2024-05-06 13:59:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 550340879, now seen corresponding path program 1 times [2024-05-06 13:59:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1506266491, now seen corresponding path program 1 times [2024-05-06 13:59:37,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1891073616, now seen corresponding path program 1 times [2024-05-06 13:59:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1601564969, now seen corresponding path program 1 times [2024-05-06 13:59:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:37,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 225434245, now seen corresponding path program 1 times [2024-05-06 13:59:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1334656117, now seen corresponding path program 1 times [2024-05-06 13:59:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1151433869, now seen corresponding path program 1 times [2024-05-06 13:59:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 175691839, now seen corresponding path program 1 times [2024-05-06 13:59:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,783 INFO L85 PathProgramCache]: Analyzing trace with hash -548518728, now seen corresponding path program 1 times [2024-05-06 13:59:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:38,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1783422396, now seen corresponding path program 1 times [2024-05-06 13:59:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:38,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1605038023, now seen corresponding path program 1 times [2024-05-06 13:59:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 225319886, now seen corresponding path program 1 times [2024-05-06 13:59:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash -269823314, now seen corresponding path program 1 times [2024-05-06 13:59:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 85074143, now seen corresponding path program 1 times [2024-05-06 13:59:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1105632541, now seen corresponding path program 1 times [2024-05-06 13:59:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -35664087, now seen corresponding path program 1 times [2024-05-06 13:59:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1525167986, now seen corresponding path program 1 times [2024-05-06 13:59:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:39,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1711765722, now seen corresponding path program 1 times [2024-05-06 13:59:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,129 INFO L85 PathProgramCache]: Analyzing trace with hash 221876623, now seen corresponding path program 1 times [2024-05-06 13:59:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -269936712, now seen corresponding path program 1 times [2024-05-06 13:59:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1099673988, now seen corresponding path program 1 times [2024-05-06 13:59:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 315520566, now seen corresponding path program 1 times [2024-05-06 13:59:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 425821868, now seen corresponding path program 1 times [2024-05-06 13:59:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -124809664, now seen corresponding path program 1 times [2024-05-06 13:59:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:40,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash -696759657, now seen corresponding path program 1 times [2024-05-06 13:59:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 116072445, now seen corresponding path program 1 times [2024-05-06 13:59:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash -273350184, now seen corresponding path program 1 times [2024-05-06 13:59:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1099561551, now seen corresponding path program 1 times [2024-05-06 13:59:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1350000627, now seen corresponding path program 1 times [2024-05-06 13:59:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash 39520512, now seen corresponding path program 1 times [2024-05-06 13:59:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:41,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2079486626, now seen corresponding path program 1 times [2024-05-06 13:59:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1591102346, now seen corresponding path program 1 times [2024-05-06 13:59:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1159707661, now seen corresponding path program 1 times [2024-05-06 13:59:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash -378230841, now seen corresponding path program 1 times [2024-05-06 13:59:42,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1096177870, now seen corresponding path program 1 times [2024-05-06 13:59:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1350112103, now seen corresponding path program 1 times [2024-05-06 13:59:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash -597738365, now seen corresponding path program 1 times [2024-05-06 13:59:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -114269193, now seen corresponding path program 1 times [2024-05-06 13:59:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:42,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1243241675, now seen corresponding path program 1 times [2024-05-06 13:59:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:55,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash 40106049, now seen corresponding path program 1 times [2024-05-06 14:00:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:07,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash 694033526, now seen corresponding path program 1 times [2024-05-06 14:00:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:19,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 992220734, now seen corresponding path program 1 times [2024-05-06 14:00:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:30,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1353465993, now seen corresponding path program 1 times [2024-05-06 14:00:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:42,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -597848880, now seen corresponding path program 1 times [2024-05-06 14:00:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:54,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 950548844, now seen corresponding path program 1 times [2024-05-06 14:01:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:04,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1536998689, now seen corresponding path program 1 times [2024-05-06 14:01:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1435055713, now seen corresponding path program 1 times [2024-05-06 14:01:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1734714143, now seen corresponding path program 1 times [2024-05-06 14:01:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1858803665, now seen corresponding path program 1 times [2024-05-06 14:01:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:23,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -77154007, now seen corresponding path program 1 times [2024-05-06 14:01:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:29,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:29,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -692214660, now seen corresponding path program 1 times [2024-05-06 14:01:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:34,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1545156570, now seen corresponding path program 1 times [2024-05-06 14:01:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:41,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -326727939, now seen corresponding path program 1 times [2024-05-06 14:01:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:47,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash -702648712, now seen corresponding path program 1 times [2024-05-06 14:01:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:53,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash 950027122, now seen corresponding path program 1 times [2024-05-06 14:01:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:58,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:02:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:02:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:02:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:02:04,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable144,SelfDestructingSolverStorable37,SelfDestructingSolverStorable145,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable137,SelfDestructingSolverStorable44,SelfDestructingSolverStorable138,SelfDestructingSolverStorable45,SelfDestructingSolverStorable139,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable133,SelfDestructingSolverStorable48,SelfDestructingSolverStorable134,SelfDestructingSolverStorable49,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable98,SelfDestructingSolverStorable99,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable126,SelfDestructingSolverStorable55,SelfDestructingSolverStorable127,SelfDestructingSolverStorable56,SelfDestructingSolverStorable128,SelfDestructingSolverStorable57,SelfDestructingSolverStorable129,SelfDestructingSolverStorable58,SelfDestructingSolverStorable122,SelfDestructingSolverStorable59,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable60,SelfDestructingSolverStorable121,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable119,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable117,SelfDestructingSolverStorable68,SelfDestructingSolverStorable118,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:02:04,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:02:04,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:02:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1980298619, now seen corresponding path program 3 times [2024-05-06 14:02:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:02:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212981937] [2024-05-06 14:02:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:02:04,908 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-06 14:02:04,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:02:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212981937] [2024-05-06 14:02:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212981937] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:02:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:02:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:02:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185335412] [2024-05-06 14:02:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:02:04,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:02:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:02:04,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:02:04,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:02:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:04,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:02:04,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-06 14:02:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:02:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:02:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:02:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:02:04,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 428099877, now seen corresponding path program 2 times [2024-05-06 14:02:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:39,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1734714143, now seen corresponding path program 2 times [2024-05-06 14:02:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:39,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1858803665, now seen corresponding path program 2 times [2024-05-06 14:02:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:39,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,116 INFO L85 PathProgramCache]: Analyzing trace with hash -77154007, now seen corresponding path program 2 times [2024-05-06 14:02:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -692214660, now seen corresponding path program 2 times [2024-05-06 14:02:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1545156570, now seen corresponding path program 2 times [2024-05-06 14:02:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash -326727939, now seen corresponding path program 2 times [2024-05-06 14:02:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -702648712, now seen corresponding path program 2 times [2024-05-06 14:02:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 950027122, now seen corresponding path program 2 times [2024-05-06 14:02:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:40,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:02:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:02:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:02:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:02:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 14:02:43,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable153,SelfDestructingSolverStorable154,SelfDestructingSolverStorable150,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149,SelfDestructingSolverStorable155,SelfDestructingSolverStorable146,SelfDestructingSolverStorable147 [2024-05-06 14:02:43,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:02:43,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:02:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1190928817, now seen corresponding path program 4 times [2024-05-06 14:02:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:02:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615266261] [2024-05-06 14:02:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:02:43,584 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-06 14:02:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:02:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615266261] [2024-05-06 14:02:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615266261] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:02:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:02:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 14:02:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313091255] [2024-05-06 14:02:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:02:43,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 14:02:43,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:02:43,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 14:02:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 14:02:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:43,586 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:02:43,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-06 14:02:43,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:43,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:02:43,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:02:43,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:02:43,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:02:43,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 14:02:43,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 428099877, now seen corresponding path program 3 times [2024-05-06 14:02:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:44,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1734714143, now seen corresponding path program 3 times [2024-05-06 14:02:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:44,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:44,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1858803665, now seen corresponding path program 3 times [2024-05-06 14:02:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -77154007, now seen corresponding path program 3 times [2024-05-06 14:02:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -692214660, now seen corresponding path program 3 times [2024-05-06 14:02:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1545156570, now seen corresponding path program 3 times [2024-05-06 14:02:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -326727939, now seen corresponding path program 3 times [2024-05-06 14:02:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash -702648712, now seen corresponding path program 3 times [2024-05-06 14:02:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 950027122, now seen corresponding path program 3 times [2024-05-06 14:02:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:45,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1137596671, now seen corresponding path program 4 times [2024-05-06 14:02:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -325320393, now seen corresponding path program 4 times [2024-05-06 14:02:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 726632181, now seen corresponding path program 4 times [2024-05-06 14:02:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash 809512748, now seen corresponding path program 4 times [2024-05-06 14:02:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1045263784, now seen corresponding path program 4 times [2024-05-06 14:02:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:46,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -27192821, now seen corresponding path program 4 times [2024-05-06 14:02:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:47,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 14:02:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:02:47,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,SelfDestructingSolverStorable163,SelfDestructingSolverStorable164,SelfDestructingSolverStorable165,SelfDestructingSolverStorable170,SelfDestructingSolverStorable160,SelfDestructingSolverStorable171,SelfDestructingSolverStorable161,SelfDestructingSolverStorable159,SelfDestructingSolverStorable166,SelfDestructingSolverStorable156,SelfDestructingSolverStorable167,SelfDestructingSolverStorable157,SelfDestructingSolverStorable168,SelfDestructingSolverStorable158,SelfDestructingSolverStorable169 [2024-05-06 14:02:47,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:02:47,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:02:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1612748209, now seen corresponding path program 5 times [2024-05-06 14:02:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:02:47,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519864385] [2024-05-06 14:02:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:47,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:47,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:02:47,085 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:02:47,087 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 14:02:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 14:02:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 14:02:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 14:02:47,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 14:02:47,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 14:02:47,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2024-05-06 14:02:47,098 INFO L448 BasicCegarLoop]: Path program histogram: [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:02:47,104 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:02:47,104 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:02:47,197 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:02:47,201 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:02:47,201 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:02:47,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:02:47 BasicIcfg [2024-05-06 14:02:47,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:02:47,221 INFO L158 Benchmark]: Toolchain (without parser) took 732321.92ms. Allocated memory was 192.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 122.5MB in the beginning and 877.8MB in the end (delta: -755.3MB). Peak memory consumption was 710.0MB. Max. memory is 8.0GB. [2024-05-06 14:02:47,221 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:02:47,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.92ms. Allocated memory was 192.9MB in the beginning and 263.2MB in the end (delta: 70.3MB). Free memory was 122.3MB in the beginning and 221.9MB in the end (delta: -99.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-05-06 14:02:47,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 263.2MB. Free memory was 221.9MB in the beginning and 219.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:02:47,221 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 263.2MB. Free memory was 219.4MB in the beginning and 217.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:02:47,221 INFO L158 Benchmark]: RCFGBuilder took 527.80ms. Allocated memory is still 263.2MB. Free memory was 217.3MB in the beginning and 180.0MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2024-05-06 14:02:47,222 INFO L158 Benchmark]: TraceAbstraction took 731217.70ms. Allocated memory was 263.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 179.0MB in the beginning and 877.8MB in the end (delta: -698.8MB). Peak memory consumption was 695.7MB. Max. memory is 8.0GB. [2024-05-06 14:02:47,223 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 192.9MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.92ms. Allocated memory was 192.9MB in the beginning and 263.2MB in the end (delta: 70.3MB). Free memory was 122.3MB in the beginning and 221.9MB in the end (delta: -99.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.35ms. Allocated memory is still 263.2MB. Free memory was 221.9MB in the beginning and 219.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 263.2MB. Free memory was 219.4MB in the beginning and 217.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 527.80ms. Allocated memory is still 263.2MB. Free memory was 217.3MB in the beginning and 180.0MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 731217.70ms. Allocated memory was 263.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 179.0MB in the beginning and 877.8MB in the end (delta: -698.8MB). Peak memory consumption was 695.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 285027, independent: 276297, independent conditional: 276145, independent unconditional: 152, dependent: 8730, dependent conditional: 8730, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 281744, independent: 276297, independent conditional: 276145, independent unconditional: 152, dependent: 5447, dependent conditional: 5447, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 281744, independent: 276297, independent conditional: 276145, independent unconditional: 152, dependent: 5447, dependent conditional: 5447, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 281744, independent: 276297, independent conditional: 276145, independent unconditional: 152, dependent: 5447, dependent conditional: 5447, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310092, independent: 276297, independent conditional: 134220, independent unconditional: 142077, dependent: 33795, dependent conditional: 26640, dependent unconditional: 7155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 310092, independent: 276297, independent conditional: 89194, independent unconditional: 187103, dependent: 33795, dependent conditional: 10805, dependent unconditional: 22990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 310092, independent: 276297, independent conditional: 89194, independent unconditional: 187103, dependent: 33795, dependent conditional: 10805, dependent unconditional: 22990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1117, independent: 1067, independent conditional: 239, independent unconditional: 828, dependent: 50, dependent conditional: 29, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1117, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 50, dependent conditional: 29, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 50, dependent conditional: 29, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 416, independent: 125, independent conditional: 122, independent unconditional: 3, dependent: 291, dependent conditional: 205, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 310092, independent: 275230, independent conditional: 88955, independent unconditional: 186275, dependent: 33745, dependent conditional: 10776, dependent unconditional: 22969, unknown: 1117, unknown conditional: 268, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 1117, Positive cache size: 1067, Positive conditional cache size: 239, Positive unconditional cache size: 828, Negative cache size: 50, Negative conditional cache size: 29, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60861, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310092, independent: 276297, independent conditional: 134220, independent unconditional: 142077, dependent: 33795, dependent conditional: 26640, dependent unconditional: 7155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 310092, independent: 276297, independent conditional: 89194, independent unconditional: 187103, dependent: 33795, dependent conditional: 10805, dependent unconditional: 22990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 310092, independent: 276297, independent conditional: 89194, independent unconditional: 187103, dependent: 33795, dependent conditional: 10805, dependent unconditional: 22990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1117, independent: 1067, independent conditional: 239, independent unconditional: 828, dependent: 50, dependent conditional: 29, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1117, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 50, dependent conditional: 29, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 50, dependent conditional: 29, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 416, independent: 125, independent conditional: 122, independent unconditional: 3, dependent: 291, dependent conditional: 205, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 310092, independent: 275230, independent conditional: 88955, independent unconditional: 186275, dependent: 33745, dependent conditional: 10776, dependent unconditional: 22969, unknown: 1117, unknown conditional: 268, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 1117, Positive cache size: 1067, Positive conditional cache size: 239, Positive unconditional cache size: 828, Negative cache size: 50, Negative conditional cache size: 29, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60861 ], Independence queries for same thread: 3283 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L726] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L727] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L728] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0] [L729] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0] [L730] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0] [L731] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L736] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z=0] [L737] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L738] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L739] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L740] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0] [L741] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L843] 0 pthread_t t153; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 730.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 728.6s, 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: 56, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 2437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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: 723.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 483, ConditionalCommutativityTraceChecks: 162, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:02:47,243 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-06 14:02:47,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...