/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 00:38:13,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 00:38:13,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 00:38:13,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 00:38:13,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 00:38:13,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 00:38:13,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 00:38:13,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 00:38:13,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 00:38:13,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 00:38:13,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 00:38:13,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 00:38:13,197 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 00:38:13,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 00:38:13,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 00:38:13,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 00:38:13,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 00:38:13,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 00:38:13,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 00:38:13,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 00:38:13,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 00:38:13,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 00:38:13,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 00:38:13,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 00:38:13,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 00:38:13,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 00:38:13,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 00:38:13,201 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 00:38:13,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 00:38:13,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 00:38:13,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 00:38:13,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 00:38:13,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 00:38:13,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 00:38:13,203 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 00:38:13,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 00:38:13,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 00:38:13,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 00:38:13,203 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 00:38:13,203 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 [2024-05-06 00:38:13,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 00:38:13,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 00:38:13,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 00:38:13,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 00:38:13,460 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 00:38:13,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-05-06 00:38:14,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 00:38:14,851 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 00:38:14,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-05-06 00:38:14,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c0e6c775b/22acc69361e7444eb1ce91625656bd7e/FLAG726249159 [2024-05-06 00:38:14,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c0e6c775b/22acc69361e7444eb1ce91625656bd7e [2024-05-06 00:38:14,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 00:38:14,880 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 00:38:14,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 00:38:14,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 00:38:14,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 00:38:14,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:38:14" (1/1) ... [2024-05-06 00:38:14,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577cea8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:14, skipping insertion in model container [2024-05-06 00:38:14,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:38:14" (1/1) ... [2024-05-06 00:38:14,921 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 00:38:15,069 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2024-05-06 00:38:15,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 00:38:15,252 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 00:38:15,261 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2024-05-06 00:38:15,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 00:38:15,371 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 00:38:15,372 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 00:38:15,377 INFO L206 MainTranslator]: Completed translation [2024-05-06 00:38:15,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15 WrapperNode [2024-05-06 00:38:15,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 00:38:15,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 00:38:15,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 00:38:15,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 00:38:15,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,435 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-05-06 00:38:15,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 00:38:15,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 00:38:15,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 00:38:15,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 00:38:15,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 00:38:15,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 00:38:15,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 00:38:15,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 00:38:15,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (1/1) ... [2024-05-06 00:38:15,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 00:38:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 00:38:15,489 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 00:38:15,522 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 00:38:15,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 00:38:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 00:38:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 00:38:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 00:38:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 00:38:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 00:38:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 00:38:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 00:38:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 00:38:15,565 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 00:38:15,682 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 00:38:15,684 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 00:38:15,885 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 00:38:16,021 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 00:38:16,021 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 00:38:16,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:38:16 BoogieIcfgContainer [2024-05-06 00:38:16,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 00:38:16,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 00:38:16,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 00:38:16,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 00:38:16,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:38:14" (1/3) ... [2024-05-06 00:38:16,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb4f645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:38:16, skipping insertion in model container [2024-05-06 00:38:16,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:38:15" (2/3) ... [2024-05-06 00:38:16,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb4f645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:38:16, skipping insertion in model container [2024-05-06 00:38:16,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:38:16" (3/3) ... [2024-05-06 00:38:16,032 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2024-05-06 00:38:16,039 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 00:38:16,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 00:38:16,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 00:38:16,046 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 00:38:16,105 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 00:38:16,146 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 00:38:16,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 00:38:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 00:38:16,149 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 00:38:16,150 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 00:38:16,179 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 00:38:16,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:38:16,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 00:38:16,203 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;@e012eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 00:38:16,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 00:38:16,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 00:38:16,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:38:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash 674133946, now seen corresponding path program 1 times [2024-05-06 00:38:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:38:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201350048] [2024-05-06 00:38:16,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:38:17,171 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 00:38:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:38:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201350048] [2024-05-06 00:38:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201350048] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:38:17,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:38:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 00:38:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116378170] [2024-05-06 00:38:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:38:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 00:38:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:38:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 00:38:17,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-05-06 00:38:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:38:17,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:38:17,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 00:38:17,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:38:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:38:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 00:38:17,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 00:38:17,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:38:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1141695004, now seen corresponding path program 1 times [2024-05-06 00:38:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:38:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848035731] [2024-05-06 00:38:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:38:17,624 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 00:38:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:38:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848035731] [2024-05-06 00:38:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848035731] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:38:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:38:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 00:38:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66947560] [2024-05-06 00:38:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:38:17,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 00:38:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:38:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 00:38:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 00:38:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:38:17,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:38:17,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 00:38:17,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:38:17,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:38:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 192727281, now seen corresponding path program 1 times [2024-05-06 00:38:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:17,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:38:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 00:38:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 00:38:18,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 00:38:18,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:38:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash 208230632, now seen corresponding path program 1 times [2024-05-06 00:38:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:38:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562707019] [2024-05-06 00:38:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:38:18,331 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 00:38:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:38:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562707019] [2024-05-06 00:38:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562707019] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:38:18,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:38:18,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 00:38:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070389107] [2024-05-06 00:38:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:38:18,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 00:38:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:38:18,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 00:38:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 00:38:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:38:18,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:38:18,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 00:38:18,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:38:18,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 00:38:18,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:38:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash 192727281, now seen corresponding path program 2 times [2024-05-06 00:38:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:18,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2084013366, now seen corresponding path program 1 times [2024-05-06 00:38:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:18,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 511083760, now seen corresponding path program 1 times [2024-05-06 00:38:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1188882917, now seen corresponding path program 1 times [2024-05-06 00:38:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -515838217, now seen corresponding path program 1 times [2024-05-06 00:38:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1923022746, now seen corresponding path program 1 times [2024-05-06 00:38:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 616222416, now seen corresponding path program 1 times [2024-05-06 00:38:19,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -118669164, now seen corresponding path program 1 times [2024-05-06 00:38:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -142375282, now seen corresponding path program 1 times [2024-05-06 00:38:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash -697329381, now seen corresponding path program 1 times [2024-05-06 00:38:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -576683803, now seen corresponding path program 1 times [2024-05-06 00:38:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:19,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 984313506, now seen corresponding path program 1 times [2024-05-06 00:38:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1555359077, now seen corresponding path program 1 times [2024-05-06 00:38:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1740956385, now seen corresponding path program 1 times [2024-05-06 00:38:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1782745556, now seen corresponding path program 1 times [2024-05-06 00:38:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1304433960, now seen corresponding path program 1 times [2024-05-06 00:38:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash -512110775, now seen corresponding path program 1 times [2024-05-06 00:38:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash -293614271, now seen corresponding path program 1 times [2024-05-06 00:38:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:20,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1514549251, now seen corresponding path program 1 times [2024-05-06 00:38:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -89690817, now seen corresponding path program 1 times [2024-05-06 00:38:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,315 INFO L85 PathProgramCache]: Analyzing trace with hash -557082550, now seen corresponding path program 1 times [2024-05-06 00:38:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1228955606, now seen corresponding path program 1 times [2024-05-06 00:38:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 46834992, now seen corresponding path program 1 times [2024-05-06 00:38:21,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1940759831, now seen corresponding path program 1 times [2024-05-06 00:38:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1337746671, now seen corresponding path program 1 times [2024-05-06 00:38:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:21,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 661360134, now seen corresponding path program 1 times [2024-05-06 00:38:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1641233738, now seen corresponding path program 1 times [2024-05-06 00:38:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash 85604347, now seen corresponding path program 1 times [2024-05-06 00:38:22,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash 834045519, now seen corresponding path program 1 times [2024-05-06 00:38:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1273830709, now seen corresponding path program 1 times [2024-05-06 00:38:22,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,558 INFO L85 PathProgramCache]: Analyzing trace with hash 179638733, now seen corresponding path program 1 times [2024-05-06 00:38:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -548394500, now seen corresponding path program 1 times [2024-05-06 00:38:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash -571879452, now seen corresponding path program 1 times [2024-05-06 00:38:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:22,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash -930997867, now seen corresponding path program 1 times [2024-05-06 00:38:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1554052793, now seen corresponding path program 1 times [2024-05-06 00:38:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1574151350, now seen corresponding path program 1 times [2024-05-06 00:38:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 87768352, now seen corresponding path program 1 times [2024-05-06 00:38:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1249757252, now seen corresponding path program 1 times [2024-05-06 00:38:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 317409502, now seen corresponding path program 1 times [2024-05-06 00:38:23,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:23,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash 148786379, now seen corresponding path program 1 times [2024-05-06 00:38:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1380673739, now seen corresponding path program 1 times [2024-05-06 00:38:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 509492775, now seen corresponding path program 1 times [2024-05-06 00:38:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 570624629, now seen corresponding path program 1 times [2024-05-06 00:38:24,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -812876708, now seen corresponding path program 1 times [2024-05-06 00:38:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:24,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -441863730, now seen corresponding path program 1 times [2024-05-06 00:38:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1094125014, now seen corresponding path program 1 times [2024-05-06 00:38:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1143673100, now seen corresponding path program 1 times [2024-05-06 00:38:25,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1838008029, now seen corresponding path program 1 times [2024-05-06 00:38:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -217804061, now seen corresponding path program 1 times [2024-05-06 00:38:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:25,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:25,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 593025701, now seen corresponding path program 1 times [2024-05-06 00:38:33,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:33,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:33,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash -307487402, now seen corresponding path program 1 times [2024-05-06 00:38:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:34,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash 857360390, now seen corresponding path program 1 times [2024-05-06 00:38:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:42,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 821365094, now seen corresponding path program 1 times [2024-05-06 00:38:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:43,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -942116842, now seen corresponding path program 1 times [2024-05-06 00:38:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:49,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:49,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:49,559 INFO L85 PathProgramCache]: Analyzing trace with hash 165043019, now seen corresponding path program 1 times [2024-05-06 00:38:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:49,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash -307438405, now seen corresponding path program 1 times [2024-05-06 00:38:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:56,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1103054593, now seen corresponding path program 1 times [2024-05-06 00:38:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:38:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:38:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:38:56,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:38:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 821468527, now seen corresponding path program 1 times [2024-05-06 00:39:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:04,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1626985605, now seen corresponding path program 1 times [2024-05-06 00:39:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:04,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:04,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash 165080949, now seen corresponding path program 1 times [2024-05-06 00:39:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:11,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1332989827, now seen corresponding path program 1 times [2024-05-06 00:39:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:11,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:18,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1102959251, now seen corresponding path program 1 times [2024-05-06 00:39:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:18,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:18,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1203926348, now seen corresponding path program 1 times [2024-05-06 00:39:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:18,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1627028092, now seen corresponding path program 1 times [2024-05-06 00:39:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:26,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:26,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash 593025684, now seen corresponding path program 1 times [2024-05-06 00:39:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:26,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1332957756, now seen corresponding path program 1 times [2024-05-06 00:39:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:33,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:33,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2019453237, now seen corresponding path program 3 times [2024-05-06 00:39:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:34,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:39:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 00:39:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 00:39:34,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,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,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 00:39:34,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 00:39:34,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:39:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash 682089422, now seen corresponding path program 2 times [2024-05-06 00:39:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:39:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382410474] [2024-05-06 00:39:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:39:35,104 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 00:39:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:39:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382410474] [2024-05-06 00:39:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382410474] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:39:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:39:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-06 00:39:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010992906] [2024-05-06 00:39:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:39:35,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-06 00:39:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:39:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 00:39:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-06 00:39:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:39:35,106 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:39:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 00:39:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:39:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 00:39:35,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 00:39:35,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:39:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 192727281, now seen corresponding path program 4 times [2024-05-06 00:39:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2084013366, now seen corresponding path program 2 times [2024-05-06 00:39:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 511083760, now seen corresponding path program 2 times [2024-05-06 00:39:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1188882917, now seen corresponding path program 2 times [2024-05-06 00:39:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash -515838217, now seen corresponding path program 2 times [2024-05-06 00:39:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1923022746, now seen corresponding path program 2 times [2024-05-06 00:39:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 616222416, now seen corresponding path program 2 times [2024-05-06 00:39:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:35,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash -118669164, now seen corresponding path program 2 times [2024-05-06 00:39:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash -142375282, now seen corresponding path program 2 times [2024-05-06 00:39:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash -697329381, now seen corresponding path program 2 times [2024-05-06 00:39:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash -576683803, now seen corresponding path program 2 times [2024-05-06 00:39:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 984313506, now seen corresponding path program 2 times [2024-05-06 00:39:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1555359077, now seen corresponding path program 2 times [2024-05-06 00:39:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1740956385, now seen corresponding path program 2 times [2024-05-06 00:39:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1782745556, now seen corresponding path program 2 times [2024-05-06 00:39:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1304433960, now seen corresponding path program 2 times [2024-05-06 00:39:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash -512110775, now seen corresponding path program 2 times [2024-05-06 00:39:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash -293614271, now seen corresponding path program 2 times [2024-05-06 00:39:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1514549251, now seen corresponding path program 2 times [2024-05-06 00:39:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -89690817, now seen corresponding path program 2 times [2024-05-06 00:39:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -557082550, now seen corresponding path program 2 times [2024-05-06 00:39:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1228955606, now seen corresponding path program 2 times [2024-05-06 00:39:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 46834992, now seen corresponding path program 2 times [2024-05-06 00:39:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1940759831, now seen corresponding path program 2 times [2024-05-06 00:39:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:37,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:37,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1337746671, now seen corresponding path program 2 times [2024-05-06 00:39:38,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 661360134, now seen corresponding path program 2 times [2024-05-06 00:39:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1641233738, now seen corresponding path program 2 times [2024-05-06 00:39:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 85604347, now seen corresponding path program 2 times [2024-05-06 00:39:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 834045519, now seen corresponding path program 2 times [2024-05-06 00:39:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1273830709, now seen corresponding path program 2 times [2024-05-06 00:39:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 179638733, now seen corresponding path program 2 times [2024-05-06 00:39:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -548394500, now seen corresponding path program 2 times [2024-05-06 00:39:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,825 INFO L85 PathProgramCache]: Analyzing trace with hash -571879452, now seen corresponding path program 2 times [2024-05-06 00:39:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:38,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,529 INFO L85 PathProgramCache]: Analyzing trace with hash -930997867, now seen corresponding path program 2 times [2024-05-06 00:39:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1554052793, now seen corresponding path program 2 times [2024-05-06 00:39:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1574151350, now seen corresponding path program 2 times [2024-05-06 00:39:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash 87768352, now seen corresponding path program 2 times [2024-05-06 00:39:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1249757252, now seen corresponding path program 2 times [2024-05-06 00:39:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 317409502, now seen corresponding path program 2 times [2024-05-06 00:39:39,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 148786379, now seen corresponding path program 2 times [2024-05-06 00:39:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:39,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1380673739, now seen corresponding path program 2 times [2024-05-06 00:39:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash 509492775, now seen corresponding path program 2 times [2024-05-06 00:39:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash 570624629, now seen corresponding path program 2 times [2024-05-06 00:39:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash -812876708, now seen corresponding path program 2 times [2024-05-06 00:39:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash -441863730, now seen corresponding path program 2 times [2024-05-06 00:39:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1094125014, now seen corresponding path program 2 times [2024-05-06 00:39:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1143673100, now seen corresponding path program 2 times [2024-05-06 00:39:40,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1838008029, now seen corresponding path program 2 times [2024-05-06 00:39:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:40,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -217804061, now seen corresponding path program 2 times [2024-05-06 00:39:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:41,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1221501487, now seen corresponding path program 5 times [2024-05-06 00:39:47,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:47,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash -792294344, now seen corresponding path program 3 times [2024-05-06 00:39:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2075552338, now seen corresponding path program 3 times [2024-05-06 00:39:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -416772514, now seen corresponding path program 3 times [2024-05-06 00:39:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,632 INFO L85 PathProgramCache]: Analyzing trace with hash 678878761, now seen corresponding path program 3 times [2024-05-06 00:39:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 188662173, now seen corresponding path program 3 times [2024-05-06 00:39:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash -753053872, now seen corresponding path program 3 times [2024-05-06 00:39:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:48,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash 390936311, now seen corresponding path program 3 times [2024-05-06 00:39:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:49,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 317921039, now seen corresponding path program 3 times [2024-05-06 00:39:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:49,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:50,771 INFO L85 PathProgramCache]: Analyzing trace with hash -307487402, now seen corresponding path program 2 times [2024-05-06 00:39:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:50,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 821365094, now seen corresponding path program 2 times [2024-05-06 00:39:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:39:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:39:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:39:58,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:39:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 165043019, now seen corresponding path program 2 times [2024-05-06 00:40:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:05,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:13,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1103054593, now seen corresponding path program 2 times [2024-05-06 00:40:13,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:13,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1626985605, now seen corresponding path program 2 times [2024-05-06 00:40:19,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:19,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1332989827, now seen corresponding path program 2 times [2024-05-06 00:40:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:26,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1203926348, now seen corresponding path program 2 times [2024-05-06 00:40:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:34,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash 593025684, now seen corresponding path program 2 times [2024-05-06 00:40:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:39,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2019453237, now seen corresponding path program 6 times [2024-05-06 00:40:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:46,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash -896427666, now seen corresponding path program 4 times [2024-05-06 00:40:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 940914284, now seen corresponding path program 4 times [2024-05-06 00:40:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1372690870, now seen corresponding path program 4 times [2024-05-06 00:40:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash 875564323, now seen corresponding path program 4 times [2024-05-06 00:40:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:47,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash 28243991, now seen corresponding path program 4 times [2024-05-06 00:40:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1021201718, now seen corresponding path program 4 times [2024-05-06 00:40:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1834057329, now seen corresponding path program 4 times [2024-05-06 00:40:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2137373141, now seen corresponding path program 4 times [2024-05-06 00:40:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:40:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:40:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:40:48,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:40:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:41:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash -162691193, now seen corresponding path program 7 times [2024-05-06 00:41:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:41:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:41:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:41:27,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:41:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:41:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 00:41:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 00:41:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 00:41:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 00:41:27,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable144,SelfDestructingSolverStorable101,SelfDestructingSolverStorable145,SelfDestructingSolverStorable102,SelfDestructingSolverStorable146,SelfDestructingSolverStorable103,SelfDestructingSolverStorable147,SelfDestructingSolverStorable140,SelfDestructingSolverStorable80,SelfDestructingSolverStorable141,SelfDestructingSolverStorable81,SelfDestructingSolverStorable142,SelfDestructingSolverStorable82,SelfDestructingSolverStorable143,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable137,SelfDestructingSolverStorable88,SelfDestructingSolverStorable138,SelfDestructingSolverStorable89,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable131,SelfDestructingSolverStorable93,SelfDestructingSolverStorable132,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 00:41:27,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 00:41:27,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:41:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1782785134, now seen corresponding path program 3 times [2024-05-06 00:41:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:41:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691572550] [2024-05-06 00:41:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:41:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:41:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:41:27,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:41:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:41:27,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 00:41:27,840 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 00:41:27,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 00:41:27,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 00:41:27,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 00:41:27,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 00:41:27,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 00:41:27,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 00:41:27,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-05-06 00:41:27,856 INFO L448 BasicCegarLoop]: Path program histogram: [7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 00:41:27,860 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 00:41:27,861 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 00:41:27,933 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 00:41:27,935 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 00:41:27,936 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 00:41:27,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 12:41:27 BasicIcfg [2024-05-06 00:41:27,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 00:41:27,964 INFO L158 Benchmark]: Toolchain (without parser) took 193083.28ms. Allocated memory was 308.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 235.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 319.0MB. Max. memory is 8.0GB. [2024-05-06 00:41:27,964 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 308.3MB. Free memory is still 276.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 00:41:27,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.05ms. Allocated memory is still 308.3MB. Free memory was 234.9MB in the beginning and 274.4MB in the end (delta: -39.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-05-06 00:41:27,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.26ms. Allocated memory is still 308.3MB. Free memory was 274.4MB in the beginning and 271.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 00:41:27,964 INFO L158 Benchmark]: Boogie Preprocessor took 26.11ms. Allocated memory is still 308.3MB. Free memory was 271.8MB in the beginning and 269.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 00:41:27,964 INFO L158 Benchmark]: RCFGBuilder took 559.17ms. Allocated memory is still 308.3MB. Free memory was 269.7MB in the beginning and 238.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2024-05-06 00:41:27,964 INFO L158 Benchmark]: TraceAbstraction took 191937.30ms. Allocated memory was 308.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 237.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 320.1MB. Max. memory is 8.0GB. [2024-05-06 00:41:27,965 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.11ms. Allocated memory is still 308.3MB. Free memory is still 276.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.05ms. Allocated memory is still 308.3MB. Free memory was 234.9MB in the beginning and 274.4MB in the end (delta: -39.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.26ms. Allocated memory is still 308.3MB. Free memory was 274.4MB in the beginning and 271.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.11ms. Allocated memory is still 308.3MB. Free memory was 271.8MB in the beginning and 269.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.17ms. Allocated memory is still 308.3MB. Free memory was 269.7MB in the beginning and 238.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 191937.30ms. Allocated memory was 308.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 237.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 320.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 63019, independent: 62380, independent conditional: 62336, independent unconditional: 44, dependent: 639, dependent conditional: 639, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62962, independent: 62380, independent conditional: 62336, independent unconditional: 44, dependent: 582, dependent conditional: 582, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62962, independent: 62380, independent conditional: 62336, independent unconditional: 44, dependent: 582, dependent conditional: 582, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62962, independent: 62380, independent conditional: 62336, independent unconditional: 44, dependent: 582, dependent conditional: 582, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64391, independent: 62380, independent conditional: 29479, independent unconditional: 32901, dependent: 2011, dependent conditional: 1427, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64391, independent: 62380, independent conditional: 14210, independent unconditional: 48170, dependent: 2011, dependent conditional: 556, dependent unconditional: 1455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64391, independent: 62380, independent conditional: 14210, independent unconditional: 48170, dependent: 2011, dependent conditional: 556, dependent unconditional: 1455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 839, independent: 819, independent conditional: 186, independent unconditional: 633, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 839, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, independent: 39, independent conditional: 35, independent unconditional: 3, dependent: 101, dependent conditional: 75, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 64391, independent: 61561, independent conditional: 14024, independent unconditional: 47537, dependent: 1991, dependent conditional: 547, dependent unconditional: 1444, unknown: 839, unknown conditional: 195, unknown unconditional: 644] , Statistics on independence cache: Total cache size (in pairs): 839, Positive cache size: 819, Positive conditional cache size: 186, Positive unconditional cache size: 633, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16140, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64391, independent: 62380, independent conditional: 29479, independent unconditional: 32901, dependent: 2011, dependent conditional: 1427, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64391, independent: 62380, independent conditional: 14210, independent unconditional: 48170, dependent: 2011, dependent conditional: 556, dependent unconditional: 1455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64391, independent: 62380, independent conditional: 14210, independent unconditional: 48170, dependent: 2011, dependent conditional: 556, dependent unconditional: 1455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 839, independent: 819, independent conditional: 186, independent unconditional: 633, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 839, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, independent: 39, independent conditional: 35, independent unconditional: 3, dependent: 101, dependent conditional: 75, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 64391, independent: 61561, independent conditional: 14024, independent unconditional: 47537, dependent: 1991, dependent conditional: 547, dependent unconditional: 1444, unknown: 839, unknown conditional: 195, unknown unconditional: 644] , Statistics on independence cache: Total cache size (in pairs): 839, Positive cache size: 819, Positive conditional cache size: 186, Positive unconditional cache size: 633, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16140 ], Independence queries for same thread: 57 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 0 pthread_t t1394; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1395; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1396; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L781] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L810] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 191.7s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 189.4s, 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: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 1392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 187.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 379, ConditionalCommutativityTraceChecks: 144, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 00:41:27,992 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 00:41:28,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...