/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/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:53:12,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:53:12,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:53:12,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:53:12,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:53:12,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:53:12,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:53:12,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:53:12,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:53:12,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:53:12,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:53:12,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:53:12,913 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:53:12,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:53:12,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:53:12,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:53:12,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:53:12,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:53:12,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:53:12,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:53:12,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:53:12,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:53:12,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:53:12,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:53:12,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:53:12,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:53:12,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:53:12,917 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:53:12,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:53:12,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:53:12,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:53:12,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:53:12,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:53:12,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:53:12,920 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:53:12,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:53:12,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:53:12,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:53:12,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:53:12,921 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 14:53:13,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:53:13,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:53:13,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:53:13,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:53:13,175 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:53:13,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2024-05-06 14:53:14,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:53:14,604 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:53:14,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2024-05-06 14:53:14,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f631db4bd/b99bdf490f4f46539a3428aa5cc8c725/FLAG1a475041d [2024-05-06 14:53:14,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f631db4bd/b99bdf490f4f46539a3428aa5cc8c725 [2024-05-06 14:53:14,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:53:14,633 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:53:14,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:53:14,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:53:14,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:53:14,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:53:14" (1/1) ... [2024-05-06 14:53:14,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffcc249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:14, skipping insertion in model container [2024-05-06 14:53:14,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:53:14" (1/1) ... [2024-05-06 14:53:14,684 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:53:14,819 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/mix046.opt.i[944,957] [2024-05-06 14:53:15,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:53:15,054 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:53:15,067 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/mix046.opt.i[944,957] [2024-05-06 14:53:15,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:53:15,190 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:53:15,190 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:53:15,197 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:53:15,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15 WrapperNode [2024-05-06 14:53:15,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:53:15,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:53:15,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:53:15,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:53:15,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,278 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2024-05-06 14:53:15,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:53:15,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:53:15,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:53:15,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:53:15,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:53:15,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:53:15,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:53:15,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:53:15,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (1/1) ... [2024-05-06 14:53:15,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:53:15,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:53:15,375 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 14:53:15,398 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 14:53:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:53:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:53:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:53:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:53:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:53:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:53:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:53:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:53:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:53:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:53:15,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:53:15,427 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 14:53:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 14:53:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:53:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:53:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:53:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:53:15,429 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 14:53:15,597 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:53:15,603 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:53:15,857 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:53:15,984 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:53:15,984 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:53:15,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:53:15 BoogieIcfgContainer [2024-05-06 14:53:15,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:53:15,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:53:15,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:53:15,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:53:15,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:53:14" (1/3) ... [2024-05-06 14:53:15,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692c3855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:53:15, skipping insertion in model container [2024-05-06 14:53:15,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:15" (2/3) ... [2024-05-06 14:53:15,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692c3855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:53:15, skipping insertion in model container [2024-05-06 14:53:15,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:53:15" (3/3) ... [2024-05-06 14:53:15,993 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2024-05-06 14:53:16,000 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:53:16,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:53:16,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:53:16,009 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:53:16,078 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:53:16,132 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:53:16,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:53:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:53:16,138 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 14:53:16,140 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 14:53:16,180 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:53:16,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:16,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:53:16,210 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;@50e65daa, 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 14:53:16,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 14:53:16,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:53:16,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1093842764, now seen corresponding path program 1 times [2024-05-06 14:53:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:53:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126149466] [2024-05-06 14:53:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:53:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126149466] [2024-05-06 14:53:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126149466] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:53:17,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:53:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 14:53:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733859188] [2024-05-06 14:53:17,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:53:17,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 14:53:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:53:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:53:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 14:53:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:17,323 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:53:17,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 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 14:53:17,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:17,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:53:17,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:53:17,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:53:17,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -686707939, now seen corresponding path program 1 times [2024-05-06 14:53:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:53:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329417861] [2024-05-06 14:53:17,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:53:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329417861] [2024-05-06 14:53:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329417861] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:53:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:53:18,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:53:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805788754] [2024-05-06 14:53:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:53:18,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:53:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:53:18,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:53:18,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:53:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:18,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:53:18,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:53:18,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:53:18,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1144482123, now seen corresponding path program 1 times [2024-05-06 14:53:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:18,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:53:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:53:18,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:53:18,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:53:18,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1199438673, now seen corresponding path program 1 times [2024-05-06 14:53:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:53:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124205677] [2024-05-06 14:53:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:53:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124205677] [2024-05-06 14:53:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124205677] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:53:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:53:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 14:53:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271307987] [2024-05-06 14:53:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:53:19,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 14:53:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:53:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 14:53:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 14:53:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:19,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:53:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:53:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:53:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:53:19,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1144482123, now seen corresponding path program 2 times [2024-05-06 14:53:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:19,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:19,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2139073215, now seen corresponding path program 1 times [2024-05-06 14:53:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:19,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 195413524, now seen corresponding path program 1 times [2024-05-06 14:53:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1924753071, now seen corresponding path program 1 times [2024-05-06 14:53:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 477730860, now seen corresponding path program 1 times [2024-05-06 14:53:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -815873279, now seen corresponding path program 1 times [2024-05-06 14:53:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -26318478, now seen corresponding path program 1 times [2024-05-06 14:53:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:20,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1384624329, now seen corresponding path program 1 times [2024-05-06 14:53:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1894997347, now seen corresponding path program 1 times [2024-05-06 14:53:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1878533799, now seen corresponding path program 1 times [2024-05-06 14:53:21,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 753334570, now seen corresponding path program 1 times [2024-05-06 14:53:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 124546759, now seen corresponding path program 1 times [2024-05-06 14:53:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:21,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 517441645, now seen corresponding path program 1 times [2024-05-06 14:53:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2082765478, now seen corresponding path program 1 times [2024-05-06 14:53:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1339500579, now seen corresponding path program 1 times [2024-05-06 14:53:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -874493634, now seen corresponding path program 1 times [2024-05-06 14:53:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1967872081, now seen corresponding path program 1 times [2024-05-06 14:53:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1737635588, now seen corresponding path program 1 times [2024-05-06 14:53:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:22,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash -775231241, now seen corresponding path program 1 times [2024-05-06 14:53:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash 529181871, now seen corresponding path program 1 times [2024-05-06 14:53:23,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1922592171, now seen corresponding path program 1 times [2024-05-06 14:53:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1462001596, now seen corresponding path program 1 times [2024-05-06 14:53:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 759826196, now seen corresponding path program 1 times [2024-05-06 14:53:23,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:23,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1678822784, now seen corresponding path program 1 times [2024-05-06 14:53:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1590312397, now seen corresponding path program 1 times [2024-05-06 14:53:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 758770352, now seen corresponding path program 1 times [2024-05-06 14:53:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1271402507, now seen corresponding path program 1 times [2024-05-06 14:53:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1149391682, now seen corresponding path program 1 times [2024-05-06 14:53:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash -932754159, now seen corresponding path program 1 times [2024-05-06 14:53:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1138467510, now seen corresponding path program 1 times [2024-05-06 14:53:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash 517464572, now seen corresponding path program 1 times [2024-05-06 14:53:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1507328152, now seen corresponding path program 1 times [2024-05-06 14:53:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,335 INFO L85 PathProgramCache]: Analyzing trace with hash 921207881, now seen corresponding path program 1 times [2024-05-06 14:53:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:25,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2060194622, now seen corresponding path program 1 times [2024-05-06 14:53:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash -903373379, now seen corresponding path program 1 times [2024-05-06 14:53:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:26,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -167688368, now seen corresponding path program 1 times [2024-05-06 14:53:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1806524605, now seen corresponding path program 1 times [2024-05-06 14:53:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash 357367000, now seen corresponding path program 1 times [2024-05-06 14:53:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 427169966, now seen corresponding path program 1 times [2024-05-06 14:53:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:27,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1953442422, now seen corresponding path program 1 times [2024-05-06 14:53:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:27,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1599553669, now seen corresponding path program 1 times [2024-05-06 14:53:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:27,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1347251136, now seen corresponding path program 1 times [2024-05-06 14:53:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 14:53:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:53:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1144482123, now seen corresponding path program 3 times [2024-05-06 14:53:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:29,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2139073215, now seen corresponding path program 2 times [2024-05-06 14:53:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 195413524, now seen corresponding path program 2 times [2024-05-06 14:53:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1924753071, now seen corresponding path program 2 times [2024-05-06 14:53:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:29,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 477730860, now seen corresponding path program 2 times [2024-05-06 14:53:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash -815873279, now seen corresponding path program 2 times [2024-05-06 14:53:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -26318478, now seen corresponding path program 2 times [2024-05-06 14:53:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1384624329, now seen corresponding path program 2 times [2024-05-06 14:53:30,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1894997347, now seen corresponding path program 2 times [2024-05-06 14:53:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:30,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1878533799, now seen corresponding path program 2 times [2024-05-06 14:53:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 753334570, now seen corresponding path program 2 times [2024-05-06 14:53:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1339500579, now seen corresponding path program 2 times [2024-05-06 14:53:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -874493634, now seen corresponding path program 2 times [2024-05-06 14:53:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:31,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1967872081, now seen corresponding path program 2 times [2024-05-06 14:53:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1737635588, now seen corresponding path program 2 times [2024-05-06 14:53:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -775231241, now seen corresponding path program 2 times [2024-05-06 14:53:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 529181871, now seen corresponding path program 2 times [2024-05-06 14:53:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1922592171, now seen corresponding path program 2 times [2024-05-06 14:53:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1462001596, now seen corresponding path program 2 times [2024-05-06 14:53:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:32,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 758770352, now seen corresponding path program 2 times [2024-05-06 14:53:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:33,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:33,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1271402507, now seen corresponding path program 2 times [2024-05-06 14:53:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:33,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1742949548, now seen corresponding path program 1 times [2024-05-06 14:53:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:56,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1423098344, now seen corresponding path program 1 times [2024-05-06 14:53:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:57,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1201084021, now seen corresponding path program 1 times [2024-05-06 14:53:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:57,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 177342954, now seen corresponding path program 1 times [2024-05-06 14:53:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:58,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash 559936059, now seen corresponding path program 1 times [2024-05-06 14:53:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:58,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:58,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1644502606, now seen corresponding path program 1 times [2024-05-06 14:53:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:59,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash 85512358, now seen corresponding path program 1 times [2024-05-06 14:53:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:59,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1942524944, now seen corresponding path program 1 times [2024-05-06 14:54:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:00,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash 62716915, now seen corresponding path program 1 times [2024-05-06 14:54:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:00,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 950242127, now seen corresponding path program 1 times [2024-05-06 14:54:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:23,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1936339069, now seen corresponding path program 1 times [2024-05-06 14:54:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:23,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash -630209680, now seen corresponding path program 1 times [2024-05-06 14:54:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:24,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash -574467697, now seen corresponding path program 1 times [2024-05-06 14:54:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:24,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash -18505226, now seen corresponding path program 1 times [2024-05-06 14:54:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:25,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash -277688681, now seen corresponding path program 1 times [2024-05-06 14:54:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:25,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -701680863, now seen corresponding path program 1 times [2024-05-06 14:54:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:26,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 531658293, now seen corresponding path program 1 times [2024-05-06 14:54:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:27,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1645362898, now seen corresponding path program 1 times [2024-05-06 14:54:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:27,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash -691192459, now seen corresponding path program 1 times [2024-05-06 14:54:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:48,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash 116361495, now seen corresponding path program 1 times [2024-05-06 14:54:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:48,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -688918634, now seen corresponding path program 1 times [2024-05-06 14:54:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:49,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1407645527, now seen corresponding path program 1 times [2024-05-06 14:54:49,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:49,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1985044580, now seen corresponding path program 1 times [2024-05-06 14:54:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1033862095, now seen corresponding path program 1 times [2024-05-06 14:54:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 105210439, now seen corresponding path program 1 times [2024-05-06 14:54:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1243428273, now seen corresponding path program 1 times [2024-05-06 14:54:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1483964884, now seen corresponding path program 1 times [2024-05-06 14:54:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 298492944, now seen corresponding path program 1 times [2024-05-06 14:55:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash 68968668, now seen corresponding path program 1 times [2024-05-06 14:55:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash -828994767, now seen corresponding path program 1 times [2024-05-06 14:55:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:16,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 666045870, now seen corresponding path program 1 times [2024-05-06 14:55:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1779603977, now seen corresponding path program 1 times [2024-05-06 14:55:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:17,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:17,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash -195950986, now seen corresponding path program 1 times [2024-05-06 14:55:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:17,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 547881826, now seen corresponding path program 1 times [2024-05-06 14:55:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:18,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1818892756, now seen corresponding path program 1 times [2024-05-06 14:55:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:18,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -911102545, now seen corresponding path program 1 times [2024-05-06 14:55:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:19,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2065789846, now seen corresponding path program 1 times [2024-05-06 14:55:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:39,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -59791338, now seen corresponding path program 1 times [2024-05-06 14:55:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:40,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1937798327, now seen corresponding path program 1 times [2024-05-06 14:55:40,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:40,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:40,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash 616749928, now seen corresponding path program 1 times [2024-05-06 14:55:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:41,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 19921149, now seen corresponding path program 1 times [2024-05-06 14:55:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:41,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash 277740208, now seen corresponding path program 1 times [2024-05-06 14:55:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:42,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1532993512, now seen corresponding path program 1 times [2024-05-06 14:55:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:42,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -643181426, now seen corresponding path program 1 times [2024-05-06 14:55:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:43,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 949138357, now seen corresponding path program 1 times [2024-05-06 14:55:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:43,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1406627631, now seen corresponding path program 1 times [2024-05-06 14:55:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:57,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:58,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1576649413, now seen corresponding path program 1 times [2024-05-06 14:55:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:58,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1713363214, now seen corresponding path program 1 times [2024-05-06 14:55:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:58,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2133428787, now seen corresponding path program 1 times [2024-05-06 14:55:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:59,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1455226360, now seen corresponding path program 1 times [2024-05-06 14:55:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:59,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 731437397, now seen corresponding path program 1 times [2024-05-06 14:56:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1547617474, now seen corresponding path program 1 times [2024-05-06 14:56:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1197001213, now seen corresponding path program 1 times [2024-05-06 14:56:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash 515577212, now seen corresponding path program 1 times [2024-05-06 14:56:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1923031045, now seen corresponding path program 1 times [2024-05-06 14:56:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1739082481, now seen corresponding path program 1 times [2024-05-06 14:56:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:56:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 14:56:00,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable122,SelfDestructingSolverStorable59,SelfDestructingSolverStorable123,SelfDestructingSolverStorable120,SelfDestructingSolverStorable60,SelfDestructingSolverStorable121,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable119,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable117,SelfDestructingSolverStorable68,SelfDestructingSolverStorable118,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:56:00,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:56:00,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:56:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash 685793719, now seen corresponding path program 2 times [2024-05-06 14:56:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:56:00,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534455474] [2024-05-06 14:56:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:56:00,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 14:56:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:56:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534455474] [2024-05-06 14:56:00,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534455474] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:56:00,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:56:00,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 14:56:00,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435529077] [2024-05-06 14:56:00,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:56:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 14:56:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:56:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 14:56:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:56:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:00,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:56:00,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:56:00,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:56:00,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:00,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 14:56:00,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 731437397, now seen corresponding path program 2 times [2024-05-06 14:56:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:09,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1547617474, now seen corresponding path program 2 times [2024-05-06 14:56:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:09,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:09,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1197001213, now seen corresponding path program 2 times [2024-05-06 14:56:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash 515577212, now seen corresponding path program 2 times [2024-05-06 14:56:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1923031045, now seen corresponding path program 2 times [2024-05-06 14:56:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1739082481, now seen corresponding path program 2 times [2024-05-06 14:56:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1441576093, now seen corresponding path program 1 times [2024-05-06 14:56:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1709072196, now seen corresponding path program 1 times [2024-05-06 14:56:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash -988679835, now seen corresponding path program 1 times [2024-05-06 14:56:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:10,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2110100814, now seen corresponding path program 1 times [2024-05-06 14:56:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -760802797, now seen corresponding path program 1 times [2024-05-06 14:56:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,270 INFO L85 PathProgramCache]: Analyzing trace with hash -163088532, now seen corresponding path program 1 times [2024-05-06 14:56:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1657307147, now seen corresponding path program 1 times [2024-05-06 14:56:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1438935265, now seen corresponding path program 1 times [2024-05-06 14:56:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1708988589, now seen corresponding path program 1 times [2024-05-06 14:56:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash 55130420, now seen corresponding path program 1 times [2024-05-06 14:56:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2136082006, now seen corresponding path program 1 times [2024-05-06 14:56:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 68907937, now seen corresponding path program 1 times [2024-05-06 14:56:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -551964860, now seen corresponding path program 1 times [2024-05-06 14:56:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -849088485, now seen corresponding path program 1 times [2024-05-06 14:56:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1358083452, now seen corresponding path program 1 times [2024-05-06 14:56:12,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1706377552, now seen corresponding path program 1 times [2024-05-06 14:56:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 55047774, now seen corresponding path program 1 times [2024-05-06 14:56:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash 555966819, now seen corresponding path program 1 times [2024-05-06 14:56:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1787331002, now seen corresponding path program 1 times [2024-05-06 14:56:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2020556209, now seen corresponding path program 1 times [2024-05-06 14:56:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:12,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash -350461132, now seen corresponding path program 1 times [2024-05-06 14:56:13,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1119683029, now seen corresponding path program 1 times [2024-05-06 14:56:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1626449260, now seen corresponding path program 1 times [2024-05-06 14:56:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 52466528, now seen corresponding path program 1 times [2024-05-06 14:56:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 555885134, now seen corresponding path program 1 times [2024-05-06 14:56:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 710670195, now seen corresponding path program 1 times [2024-05-06 14:56:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1643137193, now seen corresponding path program 1 times [2024-05-06 14:56:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:13,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash -330097024, now seen corresponding path program 1 times [2024-05-06 14:56:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 266448005, now seen corresponding path program 1 times [2024-05-06 14:56:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -822688070, now seen corresponding path program 1 times [2024-05-06 14:56:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -26538243, now seen corresponding path program 1 times [2024-05-06 14:56:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 553333679, now seen corresponding path program 1 times [2024-05-06 14:56:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 710589471, now seen corresponding path program 1 times [2024-05-06 14:56:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1269849986, now seen corresponding path program 1 times [2024-05-06 14:56:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1506277593, now seen corresponding path program 1 times [2024-05-06 14:56:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash 550035275, now seen corresponding path program 2 times [2024-05-06 14:56:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:14,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -128775256, now seen corresponding path program 2 times [2024-05-06 14:56:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:15,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 302934764, now seen corresponding path program 2 times [2024-05-06 14:56:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:15,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:56:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 14:56:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:56:17,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable130,SelfDestructingSolverStorable152,SelfDestructingSolverStorable131,SelfDestructingSolverStorable153,SelfDestructingSolverStorable132,SelfDestructingSolverStorable154,SelfDestructingSolverStorable150,SelfDestructingSolverStorable126,SelfDestructingSolverStorable148,SelfDestructingSolverStorable127,SelfDestructingSolverStorable149,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable144,SelfDestructingSolverStorable166,SelfDestructingSolverStorable145,SelfDestructingSolverStorable167,SelfDestructingSolverStorable124,SelfDestructingSolverStorable146,SelfDestructingSolverStorable168,SelfDestructingSolverStorable125,SelfDestructingSolverStorable147,SelfDestructingSolverStorable140,SelfDestructingSolverStorable162,SelfDestructingSolverStorable141,SelfDestructingSolverStorable163,SelfDestructingSolverStorable142,SelfDestructingSolverStorable164,SelfDestructingSolverStorable143,SelfDestructingSolverStorable165,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable137,SelfDestructingSolverStorable159,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable155,SelfDestructingSolverStorable134,SelfDestructingSolverStorable156,SelfDestructingSolverStorable135,SelfDestructingSolverStorable157,SelfDestructingSolverStorable136,SelfDestructingSolverStorable158 [2024-05-06 14:56:17,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:56:17,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:56:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1107503197, now seen corresponding path program 3 times [2024-05-06 14:56:17,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:56:17,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88102273] [2024-05-06 14:56:17,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:17,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:56:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:56:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:56:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88102273] [2024-05-06 14:56:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88102273] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:56:18,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:56:18,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-06 14:56:18,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801836760] [2024-05-06 14:56:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:56:18,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-06 14:56:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:56:18,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-06 14:56:18,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-06 14:56:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:18,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:56:18,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:56:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:56:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:18,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 14:56:18,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:56:18,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:56:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 14:56:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:56:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-06 14:56:35,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2024-05-06 14:56:35,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:56:35,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:56:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1113390241, now seen corresponding path program 4 times [2024-05-06 14:56:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:56:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729950541] [2024-05-06 14:56:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:35,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:35,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:56:35,947 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:56:35,955 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 14:56:35,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 14:56:35,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 14:56:35,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 14:56:35,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 14:56:35,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 14:56:35,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 14:56:35,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2024-05-06 14:56:35,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:56:35,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:56:35,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:56:36,088 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2024-05-06 14:56:36,090 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:56:36,090 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:56:36,091 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:56:36,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:56:36 BasicIcfg [2024-05-06 14:56:36,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:56:36,120 INFO L158 Benchmark]: Toolchain (without parser) took 201487.33ms. Allocated memory was 163.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 99.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 704.9MB. Max. memory is 8.0GB. [2024-05-06 14:56:36,121 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:56:36,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.50ms. Allocated memory is still 163.6MB. Free memory was 99.3MB in the beginning and 133.2MB in the end (delta: -33.9MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2024-05-06 14:56:36,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.00ms. Allocated memory is still 163.6MB. Free memory was 133.2MB in the beginning and 130.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:56:36,121 INFO L158 Benchmark]: Boogie Preprocessor took 58.49ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 128.3MB in the end (delta: 2.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 14:56:36,123 INFO L158 Benchmark]: RCFGBuilder took 647.62ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 92.3MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2024-05-06 14:56:36,123 INFO L158 Benchmark]: TraceAbstraction took 200132.45ms. Allocated memory was 163.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 91.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 695.2MB. Max. memory is 8.0GB. [2024-05-06 14:56:36,124 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.16ms. Allocated memory is still 163.6MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.50ms. Allocated memory is still 163.6MB. Free memory was 99.3MB in the beginning and 133.2MB in the end (delta: -33.9MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.00ms. Allocated memory is still 163.6MB. Free memory was 133.2MB in the beginning and 130.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.49ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 128.3MB in the end (delta: 2.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 647.62ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 92.3MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 200132.45ms. Allocated memory was 163.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 91.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 695.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - 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: 1659142, independent: 1645140, independent conditional: 1645016, independent unconditional: 124, dependent: 14002, dependent conditional: 14002, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1658595, independent: 1645140, independent conditional: 1645016, independent unconditional: 124, dependent: 13455, dependent conditional: 13455, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1658595, independent: 1645140, independent conditional: 1645016, independent unconditional: 124, dependent: 13455, dependent conditional: 13455, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1658595, independent: 1645140, independent conditional: 1645016, independent unconditional: 124, dependent: 13455, dependent conditional: 13455, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1704660, independent: 1645140, independent conditional: 790183, independent unconditional: 854957, dependent: 59520, dependent conditional: 46066, dependent unconditional: 13454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1704660, independent: 1645140, independent conditional: 432953, independent unconditional: 1212187, dependent: 59520, dependent conditional: 12062, dependent unconditional: 47458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1704660, independent: 1645140, independent conditional: 432953, independent unconditional: 1212187, dependent: 59520, dependent conditional: 12062, dependent unconditional: 47458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1804, independent: 1772, independent conditional: 358, independent unconditional: 1414, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1804, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 31, independent unconditional: 9, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 31, independent unconditional: 9, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 76, independent conditional: 57, independent unconditional: 20, dependent: 131, dependent conditional: 96, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1704660, independent: 1643368, independent conditional: 432595, independent unconditional: 1210773, dependent: 59488, dependent conditional: 12047, dependent unconditional: 47441, unknown: 1804, unknown conditional: 373, unknown unconditional: 1431] , Statistics on independence cache: Total cache size (in pairs): 1804, Positive cache size: 1772, Positive conditional cache size: 358, Positive unconditional cache size: 1414, Negative cache size: 32, Negative conditional cache size: 15, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 391234, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1704660, independent: 1645140, independent conditional: 790183, independent unconditional: 854957, dependent: 59520, dependent conditional: 46066, dependent unconditional: 13454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1704660, independent: 1645140, independent conditional: 432953, independent unconditional: 1212187, dependent: 59520, dependent conditional: 12062, dependent unconditional: 47458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1704660, independent: 1645140, independent conditional: 432953, independent unconditional: 1212187, dependent: 59520, dependent conditional: 12062, dependent unconditional: 47458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1804, independent: 1772, independent conditional: 358, independent unconditional: 1414, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1804, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 31, independent unconditional: 9, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 40, independent conditional: 31, independent unconditional: 9, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 76, independent conditional: 57, independent unconditional: 20, dependent: 131, dependent conditional: 96, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1704660, independent: 1643368, independent conditional: 432595, independent unconditional: 1210773, dependent: 59488, dependent conditional: 12047, dependent unconditional: 47441, unknown: 1804, unknown conditional: 373, unknown unconditional: 1431] , Statistics on independence cache: Total cache size (in pairs): 1804, Positive cache size: 1772, Positive conditional cache size: 358, Positive unconditional cache size: 1414, Negative cache size: 32, Negative conditional cache size: 15, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 391234 ], Independence queries for same thread: 547 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 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) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 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 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L797] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L833] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 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 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 853]: 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: 847]: 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: 849]: 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: 851]: 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 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 199.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 196.0s, 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: 54, 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, 3.1s InterpolantComputationTime, 621 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 2052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 179.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 506, ConditionalCommutativityTraceChecks: 164, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:56:36,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 14:56:36,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...