/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 16:03:36,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 16:03:36,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 16:03:36,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 16:03:36,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 16:03:36,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 16:03:36,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 16:03:36,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 16:03:36,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 16:03:36,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 16:03:36,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 16:03:36,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 16:03:36,130 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 16:03:36,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 16:03:36,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 16:03:36,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 16:03:36,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 16:03:36,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 16:03:36,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 16:03:36,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 16:03:36,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 16:03:36,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 16:03:36,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 16:03:36,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 16:03:36,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 16:03:36,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 16:03:36,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 16:03:36,133 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 16:03:36,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 16:03:36,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 16:03:36,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 16:03:36,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 16:03:36,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 16:03:36,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 16:03:36,135 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 16:03:36,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 16:03:36,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 16:03:36,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 16:03:36,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 16:03:36,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 16:03:36,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 16:03:36,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 16:03:36,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 16:03:36,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 16:03:36,389 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 16:03:36,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-06 16:03:37,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 16:03:37,636 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 16:03:37,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-06 16:03:37,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8691d2b6d/4dd7ae160ab7489c806db2fa9c1d9286/FLAG189f4a8c0 [2024-05-06 16:03:37,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8691d2b6d/4dd7ae160ab7489c806db2fa9c1d9286 [2024-05-06 16:03:37,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 16:03:37,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 16:03:37,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 16:03:37,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 16:03:37,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 16:03:37,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:03:37" (1/1) ... [2024-05-06 16:03:37,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b4f19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:37, skipping insertion in model container [2024-05-06 16:03:37,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:03:37" (1/1) ... [2024-05-06 16:03:37,714 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 16:03:37,850 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-05-06 16:03:38,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 16:03:38,028 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 16:03:38,036 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-05-06 16:03:38,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 16:03:38,102 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 16:03:38,103 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 16:03:38,108 INFO L206 MainTranslator]: Completed translation [2024-05-06 16:03:38,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38 WrapperNode [2024-05-06 16:03:38,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 16:03:38,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 16:03:38,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 16:03:38,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 16:03:38,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,161 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-05-06 16:03:38,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 16:03:38,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 16:03:38,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 16:03:38,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 16:03:38,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 16:03:38,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 16:03:38,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 16:03:38,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 16:03:38,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (1/1) ... [2024-05-06 16:03:38,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 16:03:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:03:38,233 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 16:03:38,251 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 16:03:38,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 16:03:38,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 16:03:38,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 16:03:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 16:03:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 16:03:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 16:03:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 16:03:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 16:03:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 16:03:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 16:03:38,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 16:03:38,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 16:03:38,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 16:03:38,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 16:03:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 16:03:38,278 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 16:03:38,399 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 16:03:38,401 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 16:03:38,625 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 16:03:38,703 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 16:03:38,703 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 16:03:38,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:03:38 BoogieIcfgContainer [2024-05-06 16:03:38,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 16:03:38,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 16:03:38,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 16:03:38,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 16:03:38,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 04:03:37" (1/3) ... [2024-05-06 16:03:38,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415a3132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:03:38, skipping insertion in model container [2024-05-06 16:03:38,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:03:38" (2/3) ... [2024-05-06 16:03:38,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415a3132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:03:38, skipping insertion in model container [2024-05-06 16:03:38,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:03:38" (3/3) ... [2024-05-06 16:03:38,711 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-06 16:03:38,717 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 16:03:38,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 16:03:38,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 16:03:38,726 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 16:03:38,775 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 16:03:38,820 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 16:03:38,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 16:03:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:03:38,823 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 16:03:38,857 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 16:03:38,866 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 16:03:38,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:03:38,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 16:03:38,883 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;@5b6755e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 16:03:38,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 16:03:38,919 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 16:03:38,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:03:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash -912991678, now seen corresponding path program 1 times [2024-05-06 16:03:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:03:38,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071835029] [2024-05-06 16:03:38,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:03:39,678 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 16:03:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:03:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071835029] [2024-05-06 16:03:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071835029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:03:39,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:03:39,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 16:03:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802435638] [2024-05-06 16:03:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:03:39,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 16:03:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:03:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 16:03:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-06 16:03:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:03:39,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:03:39,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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 16:03:39,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:03:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:03:39,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 16:03:39,805 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 16:03:39,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:03:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1864828301, now seen corresponding path program 1 times [2024-05-06 16:03:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:03:39,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998919202] [2024-05-06 16:03:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:03:40,161 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 16:03:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:03:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998919202] [2024-05-06 16:03:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998919202] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:03:40,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:03:40,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 16:03:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526869131] [2024-05-06 16:03:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:03:40,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 16:03:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:03:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 16:03:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 16:03:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:03:40,164 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:03:40,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 16:03:40,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:03:40,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:03:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1408921374, now seen corresponding path program 1 times [2024-05-06 16:03:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:03:40,793 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 16:03:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:03:41,027 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 16:03:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 16:03:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-06 16:03:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash 48488640, now seen corresponding path program 1 times [2024-05-06 16:03:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:41,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:03:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 16:03:41,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 16:03:41,366 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 16:03:41,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:03:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -782734000, now seen corresponding path program 1 times [2024-05-06 16:03:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:03:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456300620] [2024-05-06 16:03:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:03:41,579 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 16:03:41,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:03:41,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456300620] [2024-05-06 16:03:41,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456300620] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:03:41,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:03:41,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 16:03:41,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554667368] [2024-05-06 16:03:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:03:41,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 16:03:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:03:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 16:03:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 16:03:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:03:41,586 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:03:41,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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 16:03:41,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:03:41,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 16:03:41,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:03:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 48488640, now seen corresponding path program 2 times [2024-05-06 16:03:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:41,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:41,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1621086511, now seen corresponding path program 1 times [2024-05-06 16:03:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:41,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1290769889, now seen corresponding path program 1 times [2024-05-06 16:03:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:42,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash -433048318, now seen corresponding path program 3 times [2024-05-06 16:03:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:42,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1232936529, now seen corresponding path program 2 times [2024-05-06 16:03:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:42,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash -514436381, now seen corresponding path program 2 times [2024-05-06 16:03:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash -586122311, now seen corresponding path program 1 times [2024-05-06 16:03:43,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1641557832, now seen corresponding path program 1 times [2024-05-06 16:03:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash -649553126, now seen corresponding path program 1 times [2024-05-06 16:03:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:43,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1067659269, now seen corresponding path program 2 times [2024-05-06 16:03:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:44,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1212465208, now seen corresponding path program 2 times [2024-05-06 16:03:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:44,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1840207900, now seen corresponding path program 2 times [2024-05-06 16:03:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:44,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -395242719, now seen corresponding path program 1 times [2024-05-06 16:03:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 304262224, now seen corresponding path program 1 times [2024-05-06 16:03:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1556616062, now seen corresponding path program 1 times [2024-05-06 16:03:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -876779677, now seen corresponding path program 2 times [2024-05-06 16:03:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1136682032, now seen corresponding path program 2 times [2024-05-06 16:03:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:45,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 933144964, now seen corresponding path program 2 times [2024-05-06 16:03:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:46,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash -416846247, now seen corresponding path program 1 times [2024-05-06 16:03:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:03:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:03:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:03:54,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:03:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 859013214, now seen corresponding path program 1 times [2024-05-06 16:04:02,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:02,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 443410759, now seen corresponding path program 1 times [2024-05-06 16:04:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:08,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:14,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1925309067, now seen corresponding path program 1 times [2024-05-06 16:04:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:14,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1184910578, now seen corresponding path program 1 times [2024-05-06 16:04:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:21,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1901426236, now seen corresponding path program 1 times [2024-05-06 16:04:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:27,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:27,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash 215823720, now seen corresponding path program 1 times [2024-05-06 16:04:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:33,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1516991290, now seen corresponding path program 1 times [2024-05-06 16:04:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:40,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1157292680, now seen corresponding path program 1 times [2024-05-06 16:04:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:47,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 762739977, now seen corresponding path program 1 times [2024-05-06 16:04:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash 163210490, now seen corresponding path program 1 times [2024-05-06 16:04:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 5314848, now seen corresponding path program 1 times [2024-05-06 16:04:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1939925413, now seen corresponding path program 1 times [2024-05-06 16:04:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 478233711, now seen corresponding path program 1 times [2024-05-06 16:04:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -400149733, now seen corresponding path program 1 times [2024-05-06 16:04:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:04:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 16:04:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:04:48,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 16:04:48,713 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 16:04:48,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:04:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash -219043444, now seen corresponding path program 2 times [2024-05-06 16:04:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:04:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678401900] [2024-05-06 16:04:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:04:49,110 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 16:04:49,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:04:49,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678401900] [2024-05-06 16:04:49,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678401900] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:04:49,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:04:49,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-06 16:04:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306402893] [2024-05-06 16:04:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:04:49,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-06 16:04:49,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:04:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 16:04:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-06 16:04:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:04:49,129 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:04:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 16:04:49,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:04:49,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 16:04:49,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:04:49,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:04:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash -416846247, now seen corresponding path program 2 times [2024-05-06 16:04:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:04:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:04:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:04:56,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:04:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash 859013214, now seen corresponding path program 2 times [2024-05-06 16:05:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:02,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 443410759, now seen corresponding path program 2 times [2024-05-06 16:05:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:08,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1925309067, now seen corresponding path program 2 times [2024-05-06 16:05:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:15,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1184910578, now seen corresponding path program 2 times [2024-05-06 16:05:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:21,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:21,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1901426236, now seen corresponding path program 2 times [2024-05-06 16:05:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:26,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 215823720, now seen corresponding path program 2 times [2024-05-06 16:05:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:32,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1516991290, now seen corresponding path program 2 times [2024-05-06 16:05:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:38,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:38,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1157292680, now seen corresponding path program 2 times [2024-05-06 16:05:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 762739977, now seen corresponding path program 2 times [2024-05-06 16:05:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash 163210490, now seen corresponding path program 2 times [2024-05-06 16:05:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 5314848, now seen corresponding path program 2 times [2024-05-06 16:05:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1939925413, now seen corresponding path program 2 times [2024-05-06 16:05:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 478233711, now seen corresponding path program 2 times [2024-05-06 16:05:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash -400149733, now seen corresponding path program 2 times [2024-05-06 16:05:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1511179889, now seen corresponding path program 1 times [2024-05-06 16:05:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1295694891, now seen corresponding path program 1 times [2024-05-06 16:05:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:45,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1133454128, now seen corresponding path program 1 times [2024-05-06 16:05:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 933326931, now seen corresponding path program 1 times [2024-05-06 16:05:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1277083303, now seen corresponding path program 1 times [2024-05-06 16:05:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2119497534, now seen corresponding path program 1 times [2024-05-06 16:05:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1732730954, now seen corresponding path program 1 times [2024-05-06 16:05:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1468191476, now seen corresponding path program 1 times [2024-05-06 16:05:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1294354296, now seen corresponding path program 1 times [2024-05-06 16:05:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 180321860, now seen corresponding path program 1 times [2024-05-06 16:05:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -559851192, now seen corresponding path program 1 times [2024-05-06 16:05:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 397640923, now seen corresponding path program 1 times [2024-05-06 16:05:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:46,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1095501537, now seen corresponding path program 1 times [2024-05-06 16:05:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash 796036550, now seen corresponding path program 1 times [2024-05-06 16:05:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash 164239406, now seen corresponding path program 1 times [2024-05-06 16:05:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1252289404, now seen corresponding path program 1 times [2024-05-06 16:05:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash 179011056, now seen corresponding path program 1 times [2024-05-06 16:05:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1795319604, now seen corresponding path program 1 times [2024-05-06 16:05:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1292050705, now seen corresponding path program 1 times [2024-05-06 16:05:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 512568916, now seen corresponding path program 1 times [2024-05-06 16:05:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash -676152186, now seen corresponding path program 1 times [2024-05-06 16:05:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash -714456705, now seen corresponding path program 1 times [2024-05-06 16:05:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash -23033515, now seen corresponding path program 1 times [2024-05-06 16:05:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 137869685, now seen corresponding path program 1 times [2024-05-06 16:05:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1796600617, now seen corresponding path program 1 times [2024-05-06 16:05:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 80613637, now seen corresponding path program 1 times [2024-05-06 16:05:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:48,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1373636217, now seen corresponding path program 1 times [2024-05-06 16:05:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:48,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash 452180545, now seen corresponding path program 1 times [2024-05-06 16:05:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:55,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -875536196, now seen corresponding path program 1 times [2024-05-06 16:05:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:05:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:05:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:05:55,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:05:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 237898476, now seen corresponding path program 1 times [2024-05-06 16:06:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:02,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:02,301 INFO L85 PathProgramCache]: Analyzing trace with hash -443835106, now seen corresponding path program 1 times [2024-05-06 16:06:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:02,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1912986442, now seen corresponding path program 1 times [2024-05-06 16:06:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:07,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash -14225945, now seen corresponding path program 1 times [2024-05-06 16:06:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:07,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1396959713, now seen corresponding path program 1 times [2024-05-06 16:06:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:14,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1108824083, now seen corresponding path program 1 times [2024-05-06 16:06:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:14,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -384458213, now seen corresponding path program 1 times [2024-05-06 16:06:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:19,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1836818467, now seen corresponding path program 1 times [2024-05-06 16:06:19,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:19,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:19,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1519692843, now seen corresponding path program 1 times [2024-05-06 16:06:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:25,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 16:06:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 16:06:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 16:06:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 16:06:25,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable40,SelfDestructingSolverStorable84,SelfDestructingSolverStorable41,SelfDestructingSolverStorable85,SelfDestructingSolverStorable42,SelfDestructingSolverStorable86,SelfDestructingSolverStorable43,SelfDestructingSolverStorable87,SelfDestructingSolverStorable44,SelfDestructingSolverStorable88,SelfDestructingSolverStorable45,SelfDestructingSolverStorable89,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-05-06 16:06:25,541 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 16:06:25,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:06:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -194653360, now seen corresponding path program 3 times [2024-05-06 16:06:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:06:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575395188] [2024-05-06 16:06:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:06:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:06:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:25,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:06:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:06:25,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 16:06:25,570 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 16:06:25,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 16:06:25,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 16:06:25,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 16:06:25,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 16:06:25,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 16:06:25,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 16:06:25,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-05-06 16:06:25,576 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 16:06:25,584 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 16:06:25,584 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 16:06:25,658 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 16:06:25,660 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 16:06:25,663 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 16:06:25,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 04:06:25 BasicIcfg [2024-05-06 16:06:25,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 16:06:25,686 INFO L158 Benchmark]: Toolchain (without parser) took 168016.58ms. Allocated memory was 306.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 236.6MB in the beginning and 652.7MB in the end (delta: -416.1MB). Peak memory consumption was 949.8MB. Max. memory is 8.0GB. [2024-05-06 16:06:25,686 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 306.2MB. Free memory is still 271.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 16:06:25,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.38ms. Allocated memory is still 306.2MB. Free memory was 236.3MB in the beginning and 213.3MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-06 16:06:25,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.44ms. Allocated memory is still 306.2MB. Free memory was 213.3MB in the beginning and 276.1MB in the end (delta: -62.8MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2024-05-06 16:06:25,688 INFO L158 Benchmark]: Boogie Preprocessor took 21.36ms. Allocated memory is still 306.2MB. Free memory was 276.1MB in the beginning and 274.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 16:06:25,689 INFO L158 Benchmark]: RCFGBuilder took 521.00ms. Allocated memory is still 306.2MB. Free memory was 274.3MB in the beginning and 242.6MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2024-05-06 16:06:25,689 INFO L158 Benchmark]: TraceAbstraction took 166978.58ms. Allocated memory was 306.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 241.3MB in the beginning and 652.7MB in the end (delta: -411.4MB). Peak memory consumption was 953.8MB. Max. memory is 8.0GB. [2024-05-06 16:06:25,690 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.10ms. Allocated memory is still 306.2MB. Free memory is still 271.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.38ms. Allocated memory is still 306.2MB. Free memory was 236.3MB in the beginning and 213.3MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.44ms. Allocated memory is still 306.2MB. Free memory was 213.3MB in the beginning and 276.1MB in the end (delta: -62.8MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.36ms. Allocated memory is still 306.2MB. Free memory was 276.1MB in the beginning and 274.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 521.00ms. Allocated memory is still 306.2MB. Free memory was 274.3MB in the beginning and 242.6MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 166978.58ms. Allocated memory was 306.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 241.3MB in the beginning and 652.7MB in the end (delta: -411.4MB). Peak memory consumption was 953.8MB. 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: 101358, independent: 100514, independent conditional: 100467, independent unconditional: 47, dependent: 844, dependent conditional: 844, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 101270, independent: 100514, independent conditional: 100467, independent unconditional: 47, dependent: 756, dependent conditional: 756, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101270, independent: 100514, independent conditional: 100467, independent unconditional: 47, dependent: 756, dependent conditional: 756, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101270, independent: 100514, independent conditional: 100467, independent unconditional: 47, dependent: 756, dependent conditional: 756, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103606, independent: 100514, independent conditional: 47636, independent unconditional: 52878, dependent: 3092, dependent conditional: 2335, dependent unconditional: 757, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103606, independent: 100514, independent conditional: 25329, independent unconditional: 75185, dependent: 3092, dependent conditional: 813, dependent unconditional: 2279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103606, independent: 100514, independent conditional: 25329, independent unconditional: 75185, dependent: 3092, dependent conditional: 813, dependent unconditional: 2279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1034, independent: 1014, independent conditional: 230, independent unconditional: 784, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1034, independent: 994, independent conditional: 0, independent unconditional: 994, 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: 10, dependent unconditional: 10, 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: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, independent: 40, independent conditional: 37, independent unconditional: 3, dependent: 146, dependent conditional: 79, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 103606, independent: 99500, independent conditional: 25099, independent unconditional: 74401, dependent: 3072, dependent conditional: 803, dependent unconditional: 2269, unknown: 1034, unknown conditional: 240, unknown unconditional: 794] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 1014, Positive conditional cache size: 230, Positive unconditional cache size: 784, Negative cache size: 20, Negative conditional cache size: 10, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23829, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103606, independent: 100514, independent conditional: 47636, independent unconditional: 52878, dependent: 3092, dependent conditional: 2335, dependent unconditional: 757, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103606, independent: 100514, independent conditional: 25329, independent unconditional: 75185, dependent: 3092, dependent conditional: 813, dependent unconditional: 2279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103606, independent: 100514, independent conditional: 25329, independent unconditional: 75185, dependent: 3092, dependent conditional: 813, dependent unconditional: 2279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1034, independent: 1014, independent conditional: 230, independent unconditional: 784, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1034, independent: 994, independent conditional: 0, independent unconditional: 994, 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: 10, dependent unconditional: 10, 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: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, independent: 40, independent conditional: 37, independent unconditional: 3, dependent: 146, dependent conditional: 79, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 103606, independent: 99500, independent conditional: 25099, independent unconditional: 74401, dependent: 3072, dependent conditional: 803, dependent unconditional: 2269, unknown: 1034, unknown conditional: 240, unknown unconditional: 794] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 1014, Positive conditional cache size: 230, Positive unconditional cache size: 784, Negative cache size: 20, Negative conditional cache size: 10, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23829 ], Independence queries for same thread: 88 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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_p0_EAX=0, __unbuffered_p1_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] [L827] 0 pthread_t t2577; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2577={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] [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={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] [L829] 0 pthread_t t2578; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={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] [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={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] [L831] 0 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={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] [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={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] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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=2] [L785] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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=2] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 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_p0_EAX=0, __unbuffered_p1_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L814] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L836] 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_p0_EAX=0, __unbuffered_p1_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 166.7s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 164.9s, 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: 32, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 1203 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: 162.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 241, ConditionalCommutativityTraceChecks: 88, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 16:06:25,705 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 16:06:25,931 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...