/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/mix003.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 13:46:01,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 13:46:01,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 13:46:01,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 13:46:01,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 13:46:01,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 13:46:01,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 13:46:01,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 13:46:01,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 13:46:01,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 13:46:01,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 13:46:01,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 13:46:01,269 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 13:46:01,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 13:46:01,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 13:46:01,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 13:46:01,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 13:46:01,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 13:46:01,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 13:46:01,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 13:46:01,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 13:46:01,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 13:46:01,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 13:46:01,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 13:46:01,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 13:46:01,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 13:46:01,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 13:46:01,272 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 13:46:01,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 13:46:01,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:46:01,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 13:46:01,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 13:46:01,274 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 13:46:01,275 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:46:01,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 13:46:01,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 13:46:01,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 13:46:01,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 13:46:01,462 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 13:46:01,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-05-06 13:46:02,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 13:46:02,770 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 13:46:02,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-05-06 13:46:02,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b2a084f2d/e5f096ce604445d78a104d15937ba623/FLAGa43dbebfd [2024-05-06 13:46:02,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b2a084f2d/e5f096ce604445d78a104d15937ba623 [2024-05-06 13:46:02,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 13:46:02,802 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 13:46:02,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 13:46:02,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 13:46:02,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 13:46:02,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:46:02" (1/1) ... [2024-05-06 13:46:02,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ddaef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:02, skipping insertion in model container [2024-05-06 13:46:02,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:46:02" (1/1) ... [2024-05-06 13:46:02,858 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 13:46:02,987 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/mix003.oepc.i[945,958] [2024-05-06 13:46:03,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:46:03,215 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 13:46:03,229 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/mix003.oepc.i[945,958] [2024-05-06 13:46:03,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:46:03,283 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:46:03,283 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:46:03,289 INFO L206 MainTranslator]: Completed translation [2024-05-06 13:46:03,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03 WrapperNode [2024-05-06 13:46:03,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 13:46:03,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 13:46:03,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 13:46:03,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 13:46:03,295 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:46:03" (1/1) ... [2024-05-06 13:46:03,308 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:46:03" (1/1) ... [2024-05-06 13:46:03,325 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2024-05-06 13:46:03,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 13:46:03,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 13:46:03,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 13:46:03,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 13:46:03,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 13:46:03,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 13:46:03,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 13:46:03,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 13:46:03,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (1/1) ... [2024-05-06 13:46:03,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:46:03,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:46:03,431 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:46:03,450 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:46:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 13:46:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 13:46:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 13:46:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 13:46:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 13:46:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 13:46:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 13:46:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 13:46:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 13:46:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 13:46:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 13:46:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 13:46:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 13:46:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 13:46:03,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 13:46:03,478 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:46:03,605 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 13:46:03,607 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 13:46:03,894 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 13:46:03,987 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 13:46:03,987 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 13:46:03,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:46:03 BoogieIcfgContainer [2024-05-06 13:46:03,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 13:46:03,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 13:46:03,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 13:46:03,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 13:46:03,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:46:02" (1/3) ... [2024-05-06 13:46:03,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6514f094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:46:03, skipping insertion in model container [2024-05-06 13:46:03,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:46:03" (2/3) ... [2024-05-06 13:46:03,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6514f094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:46:03, skipping insertion in model container [2024-05-06 13:46:03,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:46:03" (3/3) ... [2024-05-06 13:46:03,995 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2024-05-06 13:46:04,001 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 13:46:04,007 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 13:46:04,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 13:46:04,008 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 13:46:04,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 13:46:04,088 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 13:46:04,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 13:46:04,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:46:04,091 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:46:04,097 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:46:04,119 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 13:46:04,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:46:04,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 13:46:04,143 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;@314b7dfc, 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:46:04,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 13:46:04,202 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:46:04,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:46:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2012200621, now seen corresponding path program 1 times [2024-05-06 13:46:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:46:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115353373] [2024-05-06 13:46:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:46:04,516 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:46:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:46:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115353373] [2024-05-06 13:46:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115353373] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:46:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:46:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 13:46:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920596717] [2024-05-06 13:46:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:46:04,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 13:46:04,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:46:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 13:46:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 13:46:04,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:04,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:46:04,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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:46:04,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:04,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 13:46:04,606 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:46:04,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:46:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1414738005, now seen corresponding path program 1 times [2024-05-06 13:46:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:46:04,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207927223] [2024-05-06 13:46:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:46:05,531 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:46:05,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:46:05,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207927223] [2024-05-06 13:46:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207927223] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:46:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:46:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 13:46:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185964415] [2024-05-06 13:46:05,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:46:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 13:46:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:46:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 13:46:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-06 13:46:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:05,536 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:46:05,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.5) internal successors, (81), 7 states have internal predecessors, (81), 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:46:05,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:05,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:46:05,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 13:46:05,630 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:46:05,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:46:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash 285883322, now seen corresponding path program 1 times [2024-05-06 13:46:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:46:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052388380] [2024-05-06 13:46:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:46:05,947 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:46:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:46:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052388380] [2024-05-06 13:46:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052388380] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:46:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:46:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 13:46:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008197288] [2024-05-06 13:46:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:46:05,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 13:46:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:46:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 13:46:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 13:46:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:05,951 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:46:05,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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:46:05,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:05,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:46:05,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash -294380876, now seen corresponding path program 1 times [2024-05-06 13:46:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:06,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:46:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:46:06,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-05-06 13:46:06,375 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:46:06,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:46:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1068075372, now seen corresponding path program 1 times [2024-05-06 13:46:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:46:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075803507] [2024-05-06 13:46:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:46:06,657 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:46:06,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:46:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075803507] [2024-05-06 13:46:06,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075803507] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:46:06,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:46:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 13:46:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669921711] [2024-05-06 13:46:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:46:06,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 13:46:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:46:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 13:46:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 13:46:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:06,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:46:06,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:46:06,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:06,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:46:06,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:46:06,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:46:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -294380876, now seen corresponding path program 2 times [2024-05-06 13:46:06,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:06,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash 600621825, now seen corresponding path program 1 times [2024-05-06 13:46:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:07,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 796669363, now seen corresponding path program 1 times [2024-05-06 13:46:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:07,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1161926830, now seen corresponding path program 1 times [2024-05-06 13:46:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:15,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 932407526, now seen corresponding path program 1 times [2024-05-06 13:46:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:21,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash 168673096, now seen corresponding path program 1 times [2024-05-06 13:46:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:27,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash 698189312, now seen corresponding path program 1 times [2024-05-06 13:46:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:33,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 438234437, now seen corresponding path program 1 times [2024-05-06 13:46:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:39,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 568364415, now seen corresponding path program 1 times [2024-05-06 13:46:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:45,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -59484209, now seen corresponding path program 2 times [2024-05-06 13:46:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:45,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1844010111, now seen corresponding path program 2 times [2024-05-06 13:46:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:45,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1403814436, now seen corresponding path program 1 times [2024-05-06 13:46:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:52,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -370305714, now seen corresponding path program 1 times [2024-05-06 13:46:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 606969853, now seen corresponding path program 1 times [2024-05-06 13:46:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1738076312, now seen corresponding path program 1 times [2024-05-06 13:46:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1664645436, now seen corresponding path program 1 times [2024-05-06 13:46:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:46:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:46:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:46:58,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:46:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash -24472343, now seen corresponding path program 1 times [2024-05-06 13:47:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:06,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1800383599, now seen corresponding path program 1 times [2024-05-06 13:47:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:13,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1050253665, now seen corresponding path program 1 times [2024-05-06 13:47:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:20,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash -310962231, now seen corresponding path program 1 times [2024-05-06 13:47:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:26,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:33,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1118339492, now seen corresponding path program 1 times [2024-05-06 13:47:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:33,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -313131640, now seen corresponding path program 1 times [2024-05-06 13:47:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:40,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 808491864, now seen corresponding path program 2 times [2024-05-06 13:47:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:40,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash -706555624, now seen corresponding path program 2 times [2024-05-06 13:47:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:40,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 959737083, now seen corresponding path program 1 times [2024-05-06 13:47:47,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:47,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 585200535, now seen corresponding path program 1 times [2024-05-06 13:47:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:52,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1955775253, now seen corresponding path program 1 times [2024-05-06 13:47:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:52,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2097739136, now seen corresponding path program 1 times [2024-05-06 13:47:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:53,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -398753196, now seen corresponding path program 1 times [2024-05-06 13:47:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:47:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:47:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:47:53,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:47:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 434679505, now seen corresponding path program 1 times [2024-05-06 13:48:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:00,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash -263015033, now seen corresponding path program 1 times [2024-05-06 13:48:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:06,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1238489735, now seen corresponding path program 1 times [2024-05-06 13:48:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:12,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:12,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -514226463, now seen corresponding path program 1 times [2024-05-06 13:48:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:17,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1784597572, now seen corresponding path program 1 times [2024-05-06 13:48:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:24,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 750342816, now seen corresponding path program 1 times [2024-05-06 13:48:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:30,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1254906768, now seen corresponding path program 2 times [2024-05-06 13:48:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:31,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:31,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash -247403776, now seen corresponding path program 2 times [2024-05-06 13:48:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:31,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1409684707, now seen corresponding path program 1 times [2024-05-06 13:48:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:38,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1153904303, now seen corresponding path program 1 times [2024-05-06 13:48:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:45,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2037543352, now seen corresponding path program 1 times [2024-05-06 13:48:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:52,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1181256496, now seen corresponding path program 1 times [2024-05-06 13:48:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:48:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:48:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:48:58,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:48:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 38153150, now seen corresponding path program 1 times [2024-05-06 13:49:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:05,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -552946998, now seen corresponding path program 1 times [2024-05-06 13:49:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:12,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1957429445, now seen corresponding path program 1 times [2024-05-06 13:49:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:19,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1587125047, now seen corresponding path program 1 times [2024-05-06 13:49:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:25,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1472829850, now seen corresponding path program 1 times [2024-05-06 13:49:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:32,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2125772568, now seen corresponding path program 1 times [2024-05-06 13:49:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:38,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -379183509, now seen corresponding path program 1 times [2024-05-06 13:49:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:49:44,278 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:49:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:49:44,329 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:49:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:49:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-06 13:49:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1161926830, now seen corresponding path program 2 times [2024-05-06 13:49:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:50,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 932407526, now seen corresponding path program 2 times [2024-05-06 13:49:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:49:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:49:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:49:56,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:49:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 168673096, now seen corresponding path program 2 times [2024-05-06 13:50:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:03,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 698189312, now seen corresponding path program 2 times [2024-05-06 13:50:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:10,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 438234437, now seen corresponding path program 2 times [2024-05-06 13:50:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:16,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 568364415, now seen corresponding path program 2 times [2024-05-06 13:50:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:23,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1403814436, now seen corresponding path program 2 times [2024-05-06 13:50:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -370305714, now seen corresponding path program 2 times [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,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:36,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -24472343, now seen corresponding path program 2 times [2024-05-06 13:50:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:44,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1800383599, now seen corresponding path program 2 times [2024-05-06 13:50:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:49,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1050253665, now seen corresponding path program 2 times [2024-05-06 13:50:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:56,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:56,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash -310962231, now seen corresponding path program 2 times [2024-05-06 13:51:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:02,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1118339492, now seen corresponding path program 2 times [2024-05-06 13:51:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:09,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash -313131640, now seen corresponding path program 2 times [2024-05-06 13:51:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:15,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 959737083, now seen corresponding path program 2 times [2024-05-06 13:51:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:23,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 585200535, now seen corresponding path program 2 times [2024-05-06 13:51:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:32,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash 434679505, now seen corresponding path program 2 times [2024-05-06 13:51:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:39,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:39,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -263015033, now seen corresponding path program 2 times [2024-05-06 13:51:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:45,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2047962632, now seen corresponding path program 1 times [2024-05-06 13:51:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:51:52,297 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:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:51:52,356 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:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:51:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-05-06 13:52:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash 997078921, now seen corresponding path program 1 times [2024-05-06 13:52:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -937609777, now seen corresponding path program 1 times [2024-05-06 13:52:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:05,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2048012607, now seen corresponding path program 1 times [2024-05-06 13:52:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:52:08,875 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:52:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:52:08,918 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:52:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:52:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-05-06 13:55:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1063075681, now seen corresponding path program 1 times [2024-05-06 13:55:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:36,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 534840330, now seen corresponding path program 1 times [2024-05-06 13:55:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash -675481896, now seen corresponding path program 1 times [2024-05-06 13:55:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1917874452, now seen corresponding path program 1 times [2024-05-06 13:55:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1585887934, now seen corresponding path program 1 times [2024-05-06 13:55:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2129369911, now seen corresponding path program 1 times [2024-05-06 13:55:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 345785247, now seen corresponding path program 1 times [2024-05-06 13:55:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:55:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:55:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:55:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:55:37,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,SelfDestructingSolverStorable4,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable76,SelfDestructingSolverStorable33,SelfDestructingSolverStorable77,SelfDestructingSolverStorable34,SelfDestructingSolverStorable78,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable79,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable40,SelfDestructingSolverStorable84,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 13:55:37,990 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:55:37,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:55:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash 897602546, now seen corresponding path program 2 times [2024-05-06 13:55:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:55:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289761769] [2024-05-06 13:55:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:55:38,155 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:55:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:55:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289761769] [2024-05-06 13:55:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289761769] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:55:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:55:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 13:55:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365696590] [2024-05-06 13:55:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:55:38,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 13:55:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:55:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 13:55:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 13:55:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:55:38,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:55:38,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:55:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:55:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:55:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:55:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:55:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1063075681, now seen corresponding path program 2 times [2024-05-06 13:57:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:09,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 534840330, now seen corresponding path program 2 times [2024-05-06 13:57:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:09,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash -675481896, now seen corresponding path program 2 times [2024-05-06 13:57:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1917874452, now seen corresponding path program 2 times [2024-05-06 13:57:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1585887934, now seen corresponding path program 2 times [2024-05-06 13:57:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2129369911, now seen corresponding path program 2 times [2024-05-06 13:57:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash 345785247, now seen corresponding path program 2 times [2024-05-06 13:57:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1535175224, now seen corresponding path program 1 times [2024-05-06 13:57:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1989186096, now seen corresponding path program 1 times [2024-05-06 13:57:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:10,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1254846133, now seen corresponding path program 1 times [2024-05-06 13:57:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1344992563, now seen corresponding path program 1 times [2024-05-06 13:57:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1013216641, now seen corresponding path program 1 times [2024-05-06 13:57:11,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:11,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash -32684045, now seen corresponding path program 1 times [2024-05-06 13:57:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 276042594, now seen corresponding path program 1 times [2024-05-06 13:57:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1532926484, now seen corresponding path program 1 times [2024-05-06 13:57:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:11,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1989112099, now seen corresponding path program 1 times [2024-05-06 13:57:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2003829221, now seen corresponding path program 1 times [2024-05-06 13:57:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:12,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1222118997, now seen corresponding path program 1 times [2024-05-06 13:57:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1761693975, now seen corresponding path program 1 times [2024-05-06 13:57:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1744284939, now seen corresponding path program 1 times [2024-05-06 13:57:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1857382211, now seen corresponding path program 1 times [2024-05-06 13:57:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:12,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1464107352, now seen corresponding path program 1 times [2024-05-06 13:57:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1986893150, now seen corresponding path program 1 times [2024-05-06 13:57:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2003756185, now seen corresponding path program 1 times [2024-05-06 13:57:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2142848943, now seen corresponding path program 1 times [2024-05-06 13:57:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 77113078, now seen corresponding path program 1 times [2024-05-06 13:57:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1521531284, now seen corresponding path program 1 times [2024-05-06 13:57:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1613487872, now seen corresponding path program 1 times [2024-05-06 13:57:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash -640688302, now seen corresponding path program 1 times [2024-05-06 13:57:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1918997539, now seen corresponding path program 1 times [2024-05-06 13:57:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2001567027, now seen corresponding path program 1 times [2024-05-06 13:57:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2142776868, now seen corresponding path program 1 times [2024-05-06 13:57:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash 900407492, now seen corresponding path program 1 times [2024-05-06 13:57:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -718599348, now seen corresponding path program 1 times [2024-05-06 13:57:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:14,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash -715915434, now seen corresponding path program 1 times [2024-05-06 13:57:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -577281834, now seen corresponding path program 1 times [2024-05-06 13:57:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -157168964, now seen corresponding path program 1 times [2024-05-06 13:57:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1934594937, now seen corresponding path program 1 times [2024-05-06 13:57:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2140617501, now seen corresponding path program 1 times [2024-05-06 13:57:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash 900336378, now seen corresponding path program 1 times [2024-05-06 13:57:15,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:15,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 306139438, now seen corresponding path program 1 times [2024-05-06 13:57:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:16,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1720437961, now seen corresponding path program 1 times [2024-05-06 13:57:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:16,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1163874805, now seen corresponding path program 1 times [2024-05-06 13:57:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:26,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash 793741185, now seen corresponding path program 1 times [2024-05-06 13:57:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:36,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -112942415, now seen corresponding path program 1 times [2024-05-06 13:57:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:58:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:58:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:58:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:58:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 13:58:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable110,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable127,SelfDestructingSolverStorable106,SelfDestructingSolverStorable128,SelfDestructingSolverStorable107,SelfDestructingSolverStorable129,SelfDestructingSolverStorable100,SelfDestructingSolverStorable122,SelfDestructingSolverStorable101,SelfDestructingSolverStorable123,SelfDestructingSolverStorable102,SelfDestructingSolverStorable124,SelfDestructingSolverStorable103,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable119,SelfDestructingSolverStorable87,SelfDestructingSolverStorable115,SelfDestructingSolverStorable88,SelfDestructingSolverStorable116,SelfDestructingSolverStorable89,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 13:58:15,133 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 13:58:15,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:58:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash -339119362, now seen corresponding path program 3 times [2024-05-06 13:58:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:58:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327792503] [2024-05-06 13:58:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:58:15,314 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:58:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:58:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327792503] [2024-05-06 13:58:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327792503] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:58:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:58:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 13:58:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002762207] [2024-05-06 13:58:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:58:15,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 13:58:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:58:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 13:58:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 13:58:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:58:15,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:58:15,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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:58:15,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:58:15,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:58:15,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:58:15,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:58:15,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 13:58:15,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:58:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1063075681, now seen corresponding path program 3 times [2024-05-06 13:58:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:26,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash -652483578, now seen corresponding path program 1 times [2024-05-06 13:58:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1212501868, now seen corresponding path program 1 times [2024-05-06 13:58:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1101254852, now seen corresponding path program 1 times [2024-05-06 13:58:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1638186606, now seen corresponding path program 1 times [2024-05-06 13:58:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 397417145, now seen corresponding path program 1 times [2024-05-06 13:58:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1474199187, now seen corresponding path program 1 times [2024-05-06 13:58:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:58:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:58:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:58:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:58:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 13:58:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 13:58:27,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable137,SelfDestructingSolverStorable138,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136 [2024-05-06 13:58:27,907 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 13:58:27,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:58:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -236398594, now seen corresponding path program 4 times [2024-05-06 13:58:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:58:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649997958] [2024-05-06 13:58:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:27,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 13:58:27,941 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 13:58:27,942 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 13:58:27,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 13:58:27,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 13:58:27,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 13:58:27,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 13:58:27,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 13:58:27,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-05-06 13:58:27,951 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:27,956 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 13:58:27,956 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 13:58:28,014 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 13:58:28,016 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 13:58:28,017 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 13:58:28,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 01:58:28 BasicIcfg [2024-05-06 13:58:28,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 13:58:28,036 INFO L158 Benchmark]: Toolchain (without parser) took 745234.18ms. Allocated memory was 205.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 137.1MB in the beginning and 740.0MB in the end (delta: -602.9MB). Peak memory consumption was 687.2MB. Max. memory is 8.0GB. [2024-05-06 13:58:28,037 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 175.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 13:58:28,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.75ms. Allocated memory was 205.5MB in the beginning and 300.9MB in the end (delta: 95.4MB). Free memory was 137.0MB in the beginning and 261.7MB in the end (delta: -124.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-06 13:58:28,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.71ms. Allocated memory is still 300.9MB. Free memory was 261.7MB in the beginning and 259.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 13:58:28,037 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory is still 300.9MB. Free memory was 259.1MB in the beginning and 257.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 13:58:28,037 INFO L158 Benchmark]: RCFGBuilder took 611.20ms. Allocated memory is still 300.9MB. Free memory was 257.5MB in the beginning and 220.3MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-05-06 13:58:28,037 INFO L158 Benchmark]: TraceAbstraction took 744045.89ms. Allocated memory was 300.9MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 218.7MB in the beginning and 740.0MB in the end (delta: -521.3MB). Peak memory consumption was 672.9MB. Max. memory is 8.0GB. [2024-05-06 13:58:28,038 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 205.5MB. Free memory is still 175.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.75ms. Allocated memory was 205.5MB in the beginning and 300.9MB in the end (delta: 95.4MB). Free memory was 137.0MB in the beginning and 261.7MB in the end (delta: -124.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.71ms. Allocated memory is still 300.9MB. Free memory was 261.7MB in the beginning and 259.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.36ms. Allocated memory is still 300.9MB. Free memory was 259.1MB in the beginning and 257.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 611.20ms. Allocated memory is still 300.9MB. Free memory was 257.5MB in the beginning and 220.3MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 744045.89ms. Allocated memory was 300.9MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 218.7MB in the beginning and 740.0MB in the end (delta: -521.3MB). Peak memory consumption was 672.9MB. 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: 205286, independent: 198714, independent conditional: 198562, independent unconditional: 152, dependent: 6572, dependent conditional: 6572, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 202134, independent: 198714, independent conditional: 198562, independent unconditional: 152, dependent: 3420, dependent conditional: 3420, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202134, independent: 198714, independent conditional: 198562, independent unconditional: 152, dependent: 3420, dependent conditional: 3420, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202134, independent: 198714, independent conditional: 198562, independent unconditional: 152, dependent: 3420, dependent conditional: 3420, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222266, independent: 198714, independent conditional: 96480, independent unconditional: 102234, dependent: 23552, dependent conditional: 18862, dependent unconditional: 4690, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222266, independent: 198714, independent conditional: 71463, independent unconditional: 127251, dependent: 23552, dependent conditional: 7782, dependent unconditional: 15770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222266, independent: 198714, independent conditional: 71463, independent unconditional: 127251, dependent: 23552, dependent conditional: 7782, dependent unconditional: 15770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, independent: 1028, independent conditional: 271, independent unconditional: 757, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 78, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 472, independent: 142, independent conditional: 137, independent unconditional: 4, dependent: 330, dependent conditional: 251, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 222266, independent: 197686, independent conditional: 71192, independent unconditional: 126494, dependent: 23504, dependent conditional: 7753, dependent unconditional: 15751, unknown: 1076, unknown conditional: 300, unknown unconditional: 776] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1028, Positive conditional cache size: 271, Positive unconditional cache size: 757, Negative cache size: 48, Negative conditional cache size: 29, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36097, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222266, independent: 198714, independent conditional: 96480, independent unconditional: 102234, dependent: 23552, dependent conditional: 18862, dependent unconditional: 4690, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222266, independent: 198714, independent conditional: 71463, independent unconditional: 127251, dependent: 23552, dependent conditional: 7782, dependent unconditional: 15770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222266, independent: 198714, independent conditional: 71463, independent unconditional: 127251, dependent: 23552, dependent conditional: 7782, dependent unconditional: 15770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, independent: 1028, independent conditional: 271, independent unconditional: 757, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 78, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 48, dependent conditional: 29, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 472, independent: 142, independent conditional: 137, independent unconditional: 4, dependent: 330, dependent conditional: 251, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 222266, independent: 197686, independent conditional: 71192, independent unconditional: 126494, dependent: 23504, dependent conditional: 7753, dependent unconditional: 15751, unknown: 1076, unknown conditional: 300, unknown unconditional: 776] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1028, Positive conditional cache size: 271, Positive unconditional cache size: 757, Negative cache size: 48, Negative conditional cache size: 29, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36097 ], Independence queries for same thread: 3152 - 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L729] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L740] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L742] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L845] 0 pthread_t t62; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t62={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] [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t62={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] [L847] 0 pthread_t t63; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t62={5:0}, t63={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] [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t62={5:0}, t63={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] [L849] 0 pthread_t t64; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t62={5:0}, t63={6:0}, t64={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] [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t62={5:0}, t63={6:0}, t64={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] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=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] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=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] [L787] 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) [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] 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 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=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] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=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] [L796] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=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] [L801] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L804] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] 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) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 3 __unbuffered_p2_EBX = z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L823] 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) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 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 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L832] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L764] 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) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 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 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice2=0, x=1, 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] [L854] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 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) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 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 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice2=0, x=1, 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] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice2=0, x=1, 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] [L865] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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: 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. - 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: 850]: 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, 145 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 743.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 741.5s, 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: 46, 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.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 1905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 737.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 409, ConditionalCommutativityTraceChecks: 130, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 13:58:28,062 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 13:58:28,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...