/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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:22:17,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:22:17,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:22:17,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:22:17,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:22:17,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:22:17,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:22:17,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:22:17,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:22:17,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:22:17,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:22:17,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:22:17,340 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:22:17,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:22:17,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:22:17,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:22:17,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:22:17,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:22:17,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:22:17,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:22:17,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:22:17,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:22:17,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:22:17,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:22:17,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:22:17,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:22:17,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:22:17,349 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:22:17,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:22:17,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:22:17,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:22:17,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:22:17,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 14:22:17,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:22:17,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:22:17,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:22:17,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:22:17,604 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:22:17,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-05-06 14:22:18,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:22:18,871 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:22:18,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-05-06 14:22:18,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca32fcf0a/cda1df17022645538c57242ceda9e71d/FLAG3294c4548 [2024-05-06 14:22:18,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca32fcf0a/cda1df17022645538c57242ceda9e71d [2024-05-06 14:22:18,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:22:18,900 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:22:18,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:22:18,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:22:18,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:22:18,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:22:18" (1/1) ... [2024-05-06 14:22:18,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbaf0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:18, skipping insertion in model container [2024-05-06 14:22:18,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:22:18" (1/1) ... [2024-05-06 14:22:18,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:22:19,053 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2024-05-06 14:22:19,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:22:19,212 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:22:19,220 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2024-05-06 14:22:19,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:22:19,294 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:22:19,294 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:22:19,300 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:22:19,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19 WrapperNode [2024-05-06 14:22:19,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:22:19,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:22:19,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:22:19,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:22:19,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,352 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-05-06 14:22:19,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:22:19,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:22:19,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:22:19,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:22:19,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:22:19,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:22:19,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:22:19,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:22:19,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (1/1) ... [2024-05-06 14:22:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:22:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:22:19,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 14:22:19,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 14:22:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:22:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:22:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:22:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:22:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:22:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:22:19,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:22:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:22:19,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:22:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:22:19,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:22:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:22:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:22:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:22:19,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:22:19,464 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 14:22:19,608 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:22:19,610 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:22:19,905 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:22:19,979 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:22:19,979 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:22:19,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:22:19 BoogieIcfgContainer [2024-05-06 14:22:19,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:22:19,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:22:19,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:22:19,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:22:19,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:22:18" (1/3) ... [2024-05-06 14:22:19,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35138c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:22:19, skipping insertion in model container [2024-05-06 14:22:19,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:22:19" (2/3) ... [2024-05-06 14:22:19,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35138c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:22:19, skipping insertion in model container [2024-05-06 14:22:19,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:22:19" (3/3) ... [2024-05-06 14:22:19,986 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-05-06 14:22:19,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:22:20,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:22:20,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:22:20,000 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:22:20,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:22:20,073 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:22:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:22:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:22:20,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 14:22:20,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 14:22:20,112 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:22:20,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:22:20,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:22:20,127 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;@5494e3c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 14:22:20,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 14:22:20,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:22:20,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:22:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -176088975, now seen corresponding path program 1 times [2024-05-06 14:22:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:22:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220501924] [2024-05-06 14:22:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:22:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:22:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:22:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220501924] [2024-05-06 14:22:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220501924] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:22:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:22:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 14:22:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113498709] [2024-05-06 14:22:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:22:20,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 14:22:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:22:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 14:22:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 14:22:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:20,535 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:22:20,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:22:20,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:20,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:22:20,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:22:20,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:22:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1726956289, now seen corresponding path program 1 times [2024-05-06 14:22:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:22:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74848183] [2024-05-06 14:22:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:22:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:22:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:22:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74848183] [2024-05-06 14:22:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74848183] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:22:21,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:22:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 14:22:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210159971] [2024-05-06 14:22:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:22:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 14:22:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:22:21,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 14:22:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:22:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:21,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:22:21,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:22:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:22:21,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 14:22:21,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:22:21,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:22:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1818930949, now seen corresponding path program 1 times [2024-05-06 14:22:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:22:21,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897147439] [2024-05-06 14:22:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:22:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:22:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:22:21,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897147439] [2024-05-06 14:22:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897147439] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:22:21,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:22:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 14:22:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225109677] [2024-05-06 14:22:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:22:21,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 14:22:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:22:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 14:22:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 14:22:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:21,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:22:21,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:22:21,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:21,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:22:21,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1803804369, now seen corresponding path program 1 times [2024-05-06 14:22:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:22,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:22:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:22:22,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-05-06 14:22:22,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:22:22,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:22:22,246 INFO L85 PathProgramCache]: Analyzing trace with hash 636347971, now seen corresponding path program 1 times [2024-05-06 14:22:22,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:22:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212088037] [2024-05-06 14:22:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:22:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:22:23,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:22:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212088037] [2024-05-06 14:22:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212088037] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:22:23,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:22:23,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-06 14:22:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910733703] [2024-05-06 14:22:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:22:23,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-06 14:22:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:22:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-06 14:22:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-06 14:22:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:23,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:22:23,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 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 14:22:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:22:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:22:23,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1803804369, now seen corresponding path program 2 times [2024-05-06 14:22:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:23,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1103276853, now seen corresponding path program 1 times [2024-05-06 14:22:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:23,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:24,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1641324814, now seen corresponding path program 1 times [2024-05-06 14:22:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:24,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1321340069, now seen corresponding path program 1 times [2024-05-06 14:22:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:31,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash 234529464, now seen corresponding path program 1 times [2024-05-06 14:22:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:36,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash -546576721, now seen corresponding path program 1 times [2024-05-06 14:22:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:42,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1957276807, now seen corresponding path program 1 times [2024-05-06 14:22:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:47,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1587066307, now seen corresponding path program 1 times [2024-05-06 14:22:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:52,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash 364488645, now seen corresponding path program 1 times [2024-05-06 14:22:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash -838334028, now seen corresponding path program 2 times [2024-05-06 14:22:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -218550731, now seen corresponding path program 2 times [2024-05-06 14:22:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1814862293, now seen corresponding path program 3 times [2024-05-06 14:22:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:22:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:22:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:22:58,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-06 14:22:58,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:22:58,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:22:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1663808291, now seen corresponding path program 2 times [2024-05-06 14:22:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:22:58,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913542171] [2024-05-06 14:22:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:58,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:22:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:22:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:22:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913542171] [2024-05-06 14:22:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913542171] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:22:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:22:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-06 14:22:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678182447] [2024-05-06 14:22:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:22:59,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-06 14:22:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:22:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-06 14:22:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-06 14:22:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:59,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:22:59,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 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 14:22:59,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:59,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:22:59,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:22:59,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:22:59,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:22:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1803804369, now seen corresponding path program 4 times [2024-05-06 14:22:59,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:59,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1103276853, now seen corresponding path program 3 times [2024-05-06 14:22:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:59,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1641324814, now seen corresponding path program 3 times [2024-05-06 14:22:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:22:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:22:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:22:59,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:22:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1321340069, now seen corresponding path program 2 times [2024-05-06 14:23:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:04,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 234529464, now seen corresponding path program 2 times [2024-05-06 14:23:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:10,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash -546576721, now seen corresponding path program 2 times [2024-05-06 14:23:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:14,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1957276807, now seen corresponding path program 2 times [2024-05-06 14:23:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:19,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:19,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1587066307, now seen corresponding path program 2 times [2024-05-06 14:23:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:24,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash 364488645, now seen corresponding path program 2 times [2024-05-06 14:23:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:28,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:28,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -838334028, now seen corresponding path program 4 times [2024-05-06 14:23:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:28,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -218550731, now seen corresponding path program 4 times [2024-05-06 14:23:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:28,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1814862293, now seen corresponding path program 5 times [2024-05-06 14:23:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:29,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1235127877, now seen corresponding path program 1 times [2024-05-06 14:23:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:34,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1899823711, now seen corresponding path program 1 times [2024-05-06 14:23:39,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1120687179, now seen corresponding path program 1 times [2024-05-06 14:23:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash 89236633, now seen corresponding path program 1 times [2024-05-06 14:23:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash 361687850, now seen corresponding path program 1 times [2024-05-06 14:23:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:39,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1959587007, now seen corresponding path program 1 times [2024-05-06 14:23:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:44,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1045107500, now seen corresponding path program 1 times [2024-05-06 14:23:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:49,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash -864949997, now seen corresponding path program 1 times [2024-05-06 14:23:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:54,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash -166431595, now seen corresponding path program 1 times [2024-05-06 14:23:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:23:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:23:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:23:59,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:23:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1944939103, now seen corresponding path program 1 times [2024-05-06 14:24:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:03,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash 75849697, now seen corresponding path program 1 times [2024-05-06 14:24:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2117970992, now seen corresponding path program 2 times [2024-05-06 14:24:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1232590951, now seen corresponding path program 2 times [2024-05-06 14:24:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 444386545, now seen corresponding path program 2 times [2024-05-06 14:24:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:08,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 695223839, now seen corresponding path program 1 times [2024-05-06 14:24:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:14,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -393211525, now seen corresponding path program 1 times [2024-05-06 14:24:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:18,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 317997872, now seen corresponding path program 1 times [2024-05-06 14:24:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:18,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1599224556, now seen corresponding path program 1 times [2024-05-06 14:24:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:18,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -801157297, now seen corresponding path program 1 times [2024-05-06 14:24:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:19,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 271125818, now seen corresponding path program 1 times [2024-05-06 14:24:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:23,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2087014649, now seen corresponding path program 1 times [2024-05-06 14:24:28,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:28,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash -71177138, now seen corresponding path program 1 times [2024-05-06 14:24:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:32,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 829005306, now seen corresponding path program 1 times [2024-05-06 14:24:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:37,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1550855068, now seen corresponding path program 1 times [2024-05-06 14:24:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:43,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash -781214074, now seen corresponding path program 1 times [2024-05-06 14:24:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:47,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1014151157, now seen corresponding path program 2 times [2024-05-06 14:24:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:47,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1373915156, now seen corresponding path program 2 times [2024-05-06 14:24:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:47,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2103370022, now seen corresponding path program 1 times [2024-05-06 14:24:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:52,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2010363232, now seen corresponding path program 1 times [2024-05-06 14:24:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:24:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:24:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:24:56,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:24:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:02,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1300543554, now seen corresponding path program 1 times [2024-05-06 14:25:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:02,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2036315637, now seen corresponding path program 1 times [2024-05-06 14:25:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:06,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash -72812590, now seen corresponding path program 1 times [2024-05-06 14:25:11,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:11,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1383141878, now seen corresponding path program 1 times [2024-05-06 14:25:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:16,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 183257120, now seen corresponding path program 1 times [2024-05-06 14:25:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:20,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2072256126, now seen corresponding path program 1 times [2024-05-06 14:25:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:25,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -205353890, now seen corresponding path program 1 times [2024-05-06 14:25:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:30,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash -976451748, now seen corresponding path program 1 times [2024-05-06 14:25:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:35,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2131590708, now seen corresponding path program 1 times [2024-05-06 14:25:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:25:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:25:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:25:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:25:39,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:25:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 14:25:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1321340069, now seen corresponding path program 3 times [2024-05-06 14:25:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:43,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash 234529464, now seen corresponding path program 3 times [2024-05-06 14:25:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:47,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash -546576721, now seen corresponding path program 3 times [2024-05-06 14:25:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:52,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1957276807, now seen corresponding path program 3 times [2024-05-06 14:25:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:25:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:25:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:25:57,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:25:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1587066307, now seen corresponding path program 3 times [2024-05-06 14:26:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:02,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 364488645, now seen corresponding path program 3 times [2024-05-06 14:26:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:07,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1235127877, now seen corresponding path program 2 times [2024-05-06 14:26:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:11,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1899823711, now seen corresponding path program 2 times [2024-05-06 14:26:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:15,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1959587007, now seen corresponding path program 2 times [2024-05-06 14:26:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:19,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1045107500, now seen corresponding path program 2 times [2024-05-06 14:26:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:24,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash -864949997, now seen corresponding path program 2 times [2024-05-06 14:26:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:29,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash -166431595, now seen corresponding path program 2 times [2024-05-06 14:26:34,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:34,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:26:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:26:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -162359656, now seen corresponding path program 1 times [2024-05-06 14:26:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:26:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:26:39,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:26:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:26:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:26:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-06 14:26:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1408795815, now seen corresponding path program 1 times [2024-05-06 14:26:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:26:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:26:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:26:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:26:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:26:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:26:48,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:26:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-05-06 14:27:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:27:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:27:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:27:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:27:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 14:27:06,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,SelfDestructingSolverStorable32,SelfDestructingSolverStorable76,SelfDestructingSolverStorable33,SelfDestructingSolverStorable77,SelfDestructingSolverStorable34,SelfDestructingSolverStorable78,SelfDestructingSolverStorable35,SelfDestructingSolverStorable79,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable40,SelfDestructingSolverStorable84,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 14:27:06,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:27:06,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:27:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash 889436799, now seen corresponding path program 3 times [2024-05-06 14:27:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:27:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240449074] [2024-05-06 14:27:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:27:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:27:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:27:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:27:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:27:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240449074] [2024-05-06 14:27:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240449074] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:27:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:27:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-06 14:27:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674317645] [2024-05-06 14:27:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:27:06,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-06 14:27:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:27:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-06 14:27:06,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-05-06 14:27:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:27:06,798 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:27:06,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 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 14:27:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:27:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:27:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:27:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:27:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 14:27:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:29:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1582643155, now seen corresponding path program 1 times [2024-05-06 14:29:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:27,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash -443611107, now seen corresponding path program 1 times [2024-05-06 14:29:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -291402818, now seen corresponding path program 1 times [2024-05-06 14:29:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2068811401, now seen corresponding path program 1 times [2024-05-06 14:29:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash 482378397, now seen corresponding path program 1 times [2024-05-06 14:29:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:32,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1508457093, now seen corresponding path program 1 times [2024-05-06 14:29:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash 228436113, now seen corresponding path program 1 times [2024-05-06 14:29:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1254296189, now seen corresponding path program 1 times [2024-05-06 14:29:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 733197943, now seen corresponding path program 1 times [2024-05-06 14:29:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1242166659, now seen corresponding path program 1 times [2024-05-06 14:29:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash 237026654, now seen corresponding path program 1 times [2024-05-06 14:29:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:33,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2085857513, now seen corresponding path program 1 times [2024-05-06 14:29:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2006948925, now seen corresponding path program 1 times [2024-05-06 14:29:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash 203290587, now seen corresponding path program 1 times [2024-05-06 14:29:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1253485105, now seen corresponding path program 1 times [2024-05-06 14:29:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash 733172957, now seen corresponding path program 1 times [2024-05-06 14:29:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash -530538473, now seen corresponding path program 1 times [2024-05-06 14:29:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1773775646, now seen corresponding path program 1 times [2024-05-06 14:29:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:34,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1996883101, now seen corresponding path program 1 times [2024-05-06 14:29:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:35,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,339 INFO L85 PathProgramCache]: Analyzing trace with hash 202964426, now seen corresponding path program 1 times [2024-05-06 14:29:35,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash -547641540, now seen corresponding path program 1 times [2024-05-06 14:29:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:35,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1229263100, now seen corresponding path program 1 times [2024-05-06 14:29:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 732391664, now seen corresponding path program 1 times [2024-05-06 14:29:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash -530562498, now seen corresponding path program 1 times [2024-05-06 14:29:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:35,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1818230122, now seen corresponding path program 1 times [2024-05-06 14:29:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1726177630, now seen corresponding path program 1 times [2024-05-06 14:29:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1856800349, now seen corresponding path program 1 times [2024-05-06 14:29:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1464122358, now seen corresponding path program 1 times [2024-05-06 14:29:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 506960124, now seen corresponding path program 1 times [2024-05-06 14:29:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash 709093180, now seen corresponding path program 1 times [2024-05-06 14:29:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash -531314000, now seen corresponding path program 1 times [2024-05-06 14:29:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:36,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1818253186, now seen corresponding path program 1 times [2024-05-06 14:29:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash -474295210, now seen corresponding path program 1 times [2024-05-06 14:29:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash -221359585, now seen corresponding path program 1 times [2024-05-06 14:29:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1932523900, now seen corresponding path program 1 times [2024-05-06 14:29:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash 477982987, now seen corresponding path program 1 times [2024-05-06 14:29:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash 15419355, now seen corresponding path program 1 times [2024-05-06 14:29:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:37,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash -553688963, now seen corresponding path program 1 times [2024-05-06 14:29:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1818974897, now seen corresponding path program 1 times [2024-05-06 14:29:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash -474317313, now seen corresponding path program 1 times [2024-05-06 14:29:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 538888885, now seen corresponding path program 1 times [2024-05-06 14:29:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1953090497, now seen corresponding path program 1 times [2024-05-06 14:29:38,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:38,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1322472284, now seen corresponding path program 1 times [2024-05-06 14:29:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:47,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 873945899, now seen corresponding path program 1 times [2024-05-06 14:29:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:29:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:29:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:29:55,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:29:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1218733637, now seen corresponding path program 1 times [2024-05-06 14:30:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:30:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:30:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:03,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:30:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1840426339, now seen corresponding path program 1 times [2024-05-06 14:30:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:30:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:30:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:11,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:30:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash -475009233, now seen corresponding path program 1 times [2024-05-06 14:30:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:30:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:30:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:20,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:30:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:30:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:30:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:30:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:30:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:30:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:30:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 14:30:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable131,SelfDestructingSolverStorable93,SelfDestructingSolverStorable110,SelfDestructingSolverStorable132,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable127,SelfDestructingSolverStorable106,SelfDestructingSolverStorable128,SelfDestructingSolverStorable107,SelfDestructingSolverStorable129,SelfDestructingSolverStorable100,SelfDestructingSolverStorable122,SelfDestructingSolverStorable101,SelfDestructingSolverStorable123,SelfDestructingSolverStorable102,SelfDestructingSolverStorable124,SelfDestructingSolverStorable103,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable119,SelfDestructingSolverStorable87,SelfDestructingSolverStorable115,SelfDestructingSolverStorable88,SelfDestructingSolverStorable116,SelfDestructingSolverStorable89,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:30:24,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:30:24,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:30:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1149506793, now seen corresponding path program 4 times [2024-05-06 14:30:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:30:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199586889] [2024-05-06 14:30:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:30:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:30:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:30:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:30:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:30:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199586889] [2024-05-06 14:30:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199586889] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:30:24,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:30:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:30:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871769411] [2024-05-06 14:30:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:30:24,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:30:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:30:24,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:30:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:30:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:30:24,453 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:30:24,453 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 14:30:24,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:30:24,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:30:24,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:30:24,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:30:24,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:30:24,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 14:30:24,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:31:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1582643155, now seen corresponding path program 2 times [2024-05-06 14:31:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:31:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:31:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:02,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:31:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash -443611107, now seen corresponding path program 2 times [2024-05-06 14:31:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:31:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:31:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:31:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash -291402818, now seen corresponding path program 2 times [2024-05-06 14:31:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:31:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:31:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:31:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2068811401, now seen corresponding path program 2 times [2024-05-06 14:31:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:31:43,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:31:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:31:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 482378397, now seen corresponding path program 2 times [2024-05-06 14:31:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:31:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:31:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:31:43,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:31:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash 334716934, now seen corresponding path program 1 times [2024-05-06 14:32:07,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:07,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:07,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1952279169, now seen corresponding path program 1 times [2024-05-06 14:32:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:08,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -74108878, now seen corresponding path program 1 times [2024-05-06 14:32:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash -833136416, now seen corresponding path program 1 times [2024-05-06 14:32:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash 530175844, now seen corresponding path program 1 times [2024-05-06 14:32:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1819530516, now seen corresponding path program 1 times [2024-05-06 14:32:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -494241626, now seen corresponding path program 1 times [2024-05-06 14:32:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:08,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 538367162, now seen corresponding path program 1 times [2024-05-06 14:32:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:09,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:32:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:32:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-06 14:32:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:32:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 14:32:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:32:09,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable137,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable144,SelfDestructingSolverStorable134,SelfDestructingSolverStorable145,SelfDestructingSolverStorable135,SelfDestructingSolverStorable146,SelfDestructingSolverStorable136 [2024-05-06 14:32:09,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:32:09,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:32:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1322688565, now seen corresponding path program 5 times [2024-05-06 14:32:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:32:09,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867183400] [2024-05-06 14:32:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:09,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:09,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:32:09,474 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:32:09,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 14:32:09,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 14:32:09,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 14:32:09,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 14:32:09,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 14:32:09,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 14:32:09,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-05-06 14:32:09,480 INFO L448 BasicCegarLoop]: Path program histogram: [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:32:09,484 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:32:09,484 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:32:09,527 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:32:09,529 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:32:09,530 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:32:09,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:32:09 BasicIcfg [2024-05-06 14:32:09,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:32:09,549 INFO L158 Benchmark]: Toolchain (without parser) took 590648.84ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 105.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 148.8MB. Max. memory is 8.0GB. [2024-05-06 14:32:09,550 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory was 140.8MB in the beginning and 140.7MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:32:09,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.93ms. Allocated memory was 174.1MB in the beginning and 289.4MB in the end (delta: 115.3MB). Free memory was 105.5MB in the beginning and 254.7MB in the end (delta: -149.2MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2024-05-06 14:32:09,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.12ms. Allocated memory is still 289.4MB. Free memory was 254.7MB in the beginning and 252.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:32:09,550 INFO L158 Benchmark]: Boogie Preprocessor took 27.34ms. Allocated memory is still 289.4MB. Free memory was 252.1MB in the beginning and 250.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:32:09,550 INFO L158 Benchmark]: RCFGBuilder took 599.18ms. Allocated memory is still 289.4MB. Free memory was 250.0MB in the beginning and 213.8MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-05-06 14:32:09,550 INFO L158 Benchmark]: TraceAbstraction took 589566.17ms. Allocated memory was 289.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 212.8MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 139.8MB. Max. memory is 8.0GB. [2024-05-06 14:32:09,551 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory was 140.8MB in the beginning and 140.7MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.93ms. Allocated memory was 174.1MB in the beginning and 289.4MB in the end (delta: 115.3MB). Free memory was 105.5MB in the beginning and 254.7MB in the end (delta: -149.2MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.12ms. Allocated memory is still 289.4MB. Free memory was 254.7MB in the beginning and 252.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.34ms. Allocated memory is still 289.4MB. Free memory was 252.1MB in the beginning and 250.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 599.18ms. Allocated memory is still 289.4MB. Free memory was 250.0MB in the beginning and 213.8MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 589566.17ms. Allocated memory was 289.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 212.8MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 139.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: 208652, independent: 202679, independent conditional: 202533, independent unconditional: 146, dependent: 5973, dependent conditional: 5973, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 205677, independent: 202679, independent conditional: 202533, independent unconditional: 146, dependent: 2998, dependent conditional: 2998, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 205677, independent: 202679, independent conditional: 202533, independent unconditional: 146, dependent: 2998, dependent conditional: 2998, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 205677, independent: 202679, independent conditional: 202533, independent unconditional: 146, dependent: 2998, dependent conditional: 2998, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223883, independent: 202679, independent conditional: 98487, independent unconditional: 104192, dependent: 21204, dependent conditional: 16970, dependent unconditional: 4234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223883, independent: 202679, independent conditional: 66078, independent unconditional: 136601, dependent: 21204, dependent conditional: 8553, dependent unconditional: 12651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223883, independent: 202679, independent conditional: 66078, independent unconditional: 136601, dependent: 21204, dependent conditional: 8553, dependent unconditional: 12651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1052, independent: 966, independent conditional: 278, independent unconditional: 688, dependent: 86, dependent conditional: 66, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 927, independent conditional: 0, independent unconditional: 927, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 125, independent: 39, independent conditional: 35, independent unconditional: 4, dependent: 86, dependent conditional: 66, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 125, independent: 39, independent conditional: 35, independent unconditional: 4, dependent: 86, dependent conditional: 66, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 694, independent: 176, independent conditional: 173, independent unconditional: 2, dependent: 519, dependent conditional: 438, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 223883, independent: 201713, independent conditional: 65800, independent unconditional: 135913, dependent: 21118, dependent conditional: 8487, dependent unconditional: 12631, unknown: 1052, unknown conditional: 344, unknown unconditional: 708] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 966, Positive conditional cache size: 278, Positive unconditional cache size: 688, Negative cache size: 86, Negative conditional cache size: 66, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40826, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223883, independent: 202679, independent conditional: 98487, independent unconditional: 104192, dependent: 21204, dependent conditional: 16970, dependent unconditional: 4234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223883, independent: 202679, independent conditional: 66078, independent unconditional: 136601, dependent: 21204, dependent conditional: 8553, dependent unconditional: 12651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223883, independent: 202679, independent conditional: 66078, independent unconditional: 136601, dependent: 21204, dependent conditional: 8553, dependent unconditional: 12651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1052, independent: 966, independent conditional: 278, independent unconditional: 688, dependent: 86, dependent conditional: 66, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 927, independent conditional: 0, independent unconditional: 927, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 125, independent: 39, independent conditional: 35, independent unconditional: 4, dependent: 86, dependent conditional: 66, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 125, independent: 39, independent conditional: 35, independent unconditional: 4, dependent: 86, dependent conditional: 66, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 694, independent: 176, independent conditional: 173, independent unconditional: 2, dependent: 519, dependent conditional: 438, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 223883, independent: 201713, independent conditional: 65800, independent unconditional: 135913, dependent: 21118, dependent conditional: 8487, dependent unconditional: 12631, unknown: 1052, unknown conditional: 344, unknown unconditional: 708] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 966, Positive conditional cache size: 278, Positive unconditional cache size: 688, Negative cache size: 86, Negative conditional cache size: 66, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40826 ], Independence queries for same thread: 2975 - 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L724] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L725] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L726] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0] [L727] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0] [L728] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0] [L729] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L734] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z=0] [L735] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L736] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L737] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L738] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0] [L739] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t657; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t658; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t659; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 841]: 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: 839]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 589.4s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 585.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: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 602 ConstructedInterpolants, 0 QuantifiedInterpolants, 3635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 581.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 418, ConditionalCommutativityTraceChecks: 137, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:32:09,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 14:32:09,877 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...