/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 01:50:55,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 01:50:55,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 01:50:55,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 01:50:55,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 01:50:55,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 01:50:55,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 01:50:55,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 01:50:55,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 01:50:55,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 01:50:55,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 01:50:55,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 01:50:55,396 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 01:50:55,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 01:50:55,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 01:50:55,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 01:50:55,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 01:50:55,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 01:50:55,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 01:50:55,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 01:50:55,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 01:50:55,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 01:50:55,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 01:50:55,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 01:50:55,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 01:50:55,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 01:50:55,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 01:50:55,400 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 01:50:55,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 01:50:55,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 01:50:55,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 01:50:55,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 01:50:55,403 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 01:50:55,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-05-06 01:50:55,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 01:50:55,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 01:50:55,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 01:50:55,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 01:50:55,653 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 01:50:55,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-05-06 01:50:56,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 01:50:56,926 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 01:50:56,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-05-06 01:50:56,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/89066ae7d/decdb280854445788cc8da015ec3ce2e/FLAG8c1bf0876 [2024-05-06 01:50:56,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/89066ae7d/decdb280854445788cc8da015ec3ce2e [2024-05-06 01:50:56,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 01:50:56,949 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 01:50:56,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 01:50:56,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 01:50:56,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 01:50:56,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:50:56" (1/1) ... [2024-05-06 01:50:56,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cffe644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:56, skipping insertion in model container [2024-05-06 01:50:56,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:50:56" (1/1) ... [2024-05-06 01:50:57,024 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 01:50:57,135 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2024-05-06 01:50:57,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 01:50:57,287 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 01:50:57,296 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2024-05-06 01:50:57,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 01:50:57,355 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 01:50:57,355 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 01:50:57,360 INFO L206 MainTranslator]: Completed translation [2024-05-06 01:50:57,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57 WrapperNode [2024-05-06 01:50:57,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 01:50:57,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 01:50:57,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 01:50:57,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 01:50:57,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,399 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2024-05-06 01:50:57,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 01:50:57,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 01:50:57,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 01:50:57,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 01:50:57,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 01:50:57,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 01:50:57,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 01:50:57,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 01:50:57,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (1/1) ... [2024-05-06 01:50:57,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 01:50:57,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 01:50:57,461 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 01:50:57,477 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 01:50:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 01:50:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 01:50:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 01:50:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 01:50:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 01:50:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 01:50:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 01:50:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 01:50:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 01:50:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 01:50:57,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 01:50:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 01:50:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 01:50:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 01:50:57,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 01:50:57,509 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 01:50:57,634 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 01:50:57,636 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 01:50:57,837 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 01:50:57,948 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 01:50:57,948 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 01:50:57,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:50:57 BoogieIcfgContainer [2024-05-06 01:50:57,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 01:50:57,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 01:50:57,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 01:50:57,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 01:50:57,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:50:56" (1/3) ... [2024-05-06 01:50:57,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300aba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:50:57, skipping insertion in model container [2024-05-06 01:50:57,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:57" (2/3) ... [2024-05-06 01:50:57,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300aba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:50:57, skipping insertion in model container [2024-05-06 01:50:57,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:50:57" (3/3) ... [2024-05-06 01:50:57,957 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2024-05-06 01:50:57,964 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 01:50:57,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 01:50:57,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 01:50:57,972 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 01:50:58,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 01:50:58,066 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 01:50:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 01:50:58,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 01:50:58,069 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 01:50:58,081 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 01:50:58,116 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 01:50:58,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:50:58,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 01:50:58,132 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;@1da0312d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 01:50:58,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 01:50:58,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 01:50:58,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:50:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1270522473, now seen corresponding path program 1 times [2024-05-06 01:50:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:50:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019668450] [2024-05-06 01:50:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:50:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:50:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:50:58,923 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 01:50:58,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:50:58,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019668450] [2024-05-06 01:50:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019668450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:50:58,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:50:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 01:50:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051866249] [2024-05-06 01:50:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:50:58,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 01:50:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:50:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 01:50:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 01:50:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:50:58,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:50:58,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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 01:50:58,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:50:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:50:59,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 01:50:59,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 01:50:59,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:50:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1419185704, now seen corresponding path program 1 times [2024-05-06 01:50:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:50:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680908946] [2024-05-06 01:50:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:50:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:50:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:50:59,919 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 01:50:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:50:59,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680908946] [2024-05-06 01:50:59,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680908946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:50:59,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:50:59,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 01:50:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909121848] [2024-05-06 01:50:59,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:50:59,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 01:50:59,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:50:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 01:50:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 01:50:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:50:59,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:50:59,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 01:50:59,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:50:59,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:51:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1731214015, now seen corresponding path program 1 times [2024-05-06 01:51:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:05,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:51:05,664 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 01:51:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:51:05,869 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 01:51:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 01:51:05,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-06 01:51:06,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1292507733, now seen corresponding path program 1 times [2024-05-06 01:51:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:06,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:51:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 01:51:06,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 01:51:06,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 01:51:06,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:51:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash -639077413, now seen corresponding path program 1 times [2024-05-06 01:51:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:51:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657898494] [2024-05-06 01:51:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:51:06,630 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 01:51:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:51:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657898494] [2024-05-06 01:51:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657898494] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:51:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:51:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 01:51:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802206751] [2024-05-06 01:51:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:51:06,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 01:51:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:51:06,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 01:51:06,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 01:51:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:51:06,633 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:51:06,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 01:51:06,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:51:06,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-06 01:51:06,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:51:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1292507733, now seen corresponding path program 2 times [2024-05-06 01:51:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:06,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -960553957, now seen corresponding path program 1 times [2024-05-06 01:51:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash -838466346, now seen corresponding path program 1 times [2024-05-06 01:51:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1625447197, now seen corresponding path program 3 times [2024-05-06 01:51:07,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1299340571, now seen corresponding path program 2 times [2024-05-06 01:51:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:07,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -235198690, now seen corresponding path program 2 times [2024-05-06 01:51:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2147340945, now seen corresponding path program 1 times [2024-05-06 01:51:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1699429825, now seen corresponding path program 1 times [2024-05-06 01:51:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash 909907568, now seen corresponding path program 1 times [2024-05-06 01:51:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:08,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1814401481, now seen corresponding path program 2 times [2024-05-06 01:51:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash -335642943, now seen corresponding path program 2 times [2024-05-06 01:51:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1513175224, now seen corresponding path program 2 times [2024-05-06 01:51:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash 723993750, now seen corresponding path program 1 times [2024-05-06 01:51:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1255987782, now seen corresponding path program 1 times [2024-05-06 01:51:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,812 INFO L85 PathProgramCache]: Analyzing trace with hash -432354473, now seen corresponding path program 1 times [2024-05-06 01:51:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:09,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1056933214, now seen corresponding path program 2 times [2024-05-06 01:51:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:10,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:10,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1003906746, now seen corresponding path program 2 times [2024-05-06 01:51:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:10,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:10,587 INFO L85 PathProgramCache]: Analyzing trace with hash 170913183, now seen corresponding path program 2 times [2024-05-06 01:51:10,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:10,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1297136371, now seen corresponding path program 1 times [2024-05-06 01:51:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:51:13,030 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 01:51:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:51:13,115 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 01:51:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 01:51:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-05-06 01:51:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1292507733, now seen corresponding path program 4 times [2024-05-06 01:51:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:13,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:13,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash -960553957, now seen corresponding path program 3 times [2024-05-06 01:51:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:13,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash -838466346, now seen corresponding path program 3 times [2024-05-06 01:51:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:13,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1625447197, now seen corresponding path program 5 times [2024-05-06 01:51:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:14,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1299340571, now seen corresponding path program 4 times [2024-05-06 01:51:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:14,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -235198690, now seen corresponding path program 4 times [2024-05-06 01:51:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:14,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2147340945, now seen corresponding path program 3 times [2024-05-06 01:51:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:15,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1699429825, now seen corresponding path program 3 times [2024-05-06 01:51:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:15,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash 909907568, now seen corresponding path program 3 times [2024-05-06 01:51:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:15,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1814401481, now seen corresponding path program 4 times [2024-05-06 01:51:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:16,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash -335642943, now seen corresponding path program 4 times [2024-05-06 01:51:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:16,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1513175224, now seen corresponding path program 4 times [2024-05-06 01:51:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:16,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 723993750, now seen corresponding path program 3 times [2024-05-06 01:51:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:17,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1255987782, now seen corresponding path program 3 times [2024-05-06 01:51:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:17,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash -432354473, now seen corresponding path program 3 times [2024-05-06 01:51:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:17,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1056933214, now seen corresponding path program 4 times [2024-05-06 01:51:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:18,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1003906746, now seen corresponding path program 4 times [2024-05-06 01:51:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:18,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 170913183, now seen corresponding path program 4 times [2024-05-06 01:51:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:18,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2041379500, now seen corresponding path program 1 times [2024-05-06 01:51:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:45,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1026011838, now seen corresponding path program 1 times [2024-05-06 01:51:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:46,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:46,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash -864318647, now seen corresponding path program 1 times [2024-05-06 01:51:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:48,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1274756266, now seen corresponding path program 1 times [2024-05-06 01:51:49,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:49,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1067284432, now seen corresponding path program 1 times [2024-05-06 01:51:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:50,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -935298970, now seen corresponding path program 1 times [2024-05-06 01:51:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:51,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1770955952, now seen corresponding path program 1 times [2024-05-06 01:51:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:52,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1996828738, now seen corresponding path program 1 times [2024-05-06 01:51:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:53,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1034348019, now seen corresponding path program 1 times [2024-05-06 01:51:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:54,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1185305275, now seen corresponding path program 1 times [2024-05-06 01:51:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -377343856, now seen corresponding path program 1 times [2024-05-06 01:51:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -981952753, now seen corresponding path program 1 times [2024-05-06 01:51:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 938182359, now seen corresponding path program 1 times [2024-05-06 01:51:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1493652897, now seen corresponding path program 1 times [2024-05-06 01:51:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1198755191, now seen corresponding path program 1 times [2024-05-06 01:51:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash 145622549, now seen corresponding path program 6 times [2024-05-06 01:51:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:51:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 01:51:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 01:51:55,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 01:51:55,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 01:51:55,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:51:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash 402100251, now seen corresponding path program 2 times [2024-05-06 01:51:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:51:55,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980365884] [2024-05-06 01:51:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:51:56,713 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 01:51:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:51:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980365884] [2024-05-06 01:51:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980365884] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:51:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:51:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-05-06 01:51:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149846893] [2024-05-06 01:51:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:51:56,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-06 01:51:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:51:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-06 01:51:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-05-06 01:51:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:51:56,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:51:56,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 01:51:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:51:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-06 01:51:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 01:51:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:51:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1292507733, now seen corresponding path program 7 times [2024-05-06 01:51:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:56,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash -960553957, now seen corresponding path program 5 times [2024-05-06 01:51:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:57,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -838466346, now seen corresponding path program 5 times [2024-05-06 01:51:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:57,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:57,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1625447197, now seen corresponding path program 8 times [2024-05-06 01:51:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:57,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:57,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1299340571, now seen corresponding path program 6 times [2024-05-06 01:51:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:58,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash -235198690, now seen corresponding path program 6 times [2024-05-06 01:51:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2147340945, now seen corresponding path program 5 times [2024-05-06 01:51:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1699429825, now seen corresponding path program 5 times [2024-05-06 01:51:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash 909907568, now seen corresponding path program 5 times [2024-05-06 01:51:58,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:58,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1814401481, now seen corresponding path program 6 times [2024-05-06 01:51:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:59,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash -335642943, now seen corresponding path program 6 times [2024-05-06 01:51:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:51:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:59,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:51:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:51:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1513175224, now seen corresponding path program 6 times [2024-05-06 01:51:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:51:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 723993750, now seen corresponding path program 5 times [2024-05-06 01:52:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1255987782, now seen corresponding path program 5 times [2024-05-06 01:52:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash -432354473, now seen corresponding path program 5 times [2024-05-06 01:52:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:00,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1056933214, now seen corresponding path program 6 times [2024-05-06 01:52:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:01,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1003906746, now seen corresponding path program 6 times [2024-05-06 01:52:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:01,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash 170913183, now seen corresponding path program 6 times [2024-05-06 01:52:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:01,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1719102569, now seen corresponding path program 9 times [2024-05-06 01:52:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:27,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash 466317977, now seen corresponding path program 7 times [2024-05-06 01:52:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:27,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1762269544, now seen corresponding path program 7 times [2024-05-06 01:52:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash -777407181, now seen corresponding path program 7 times [2024-05-06 01:52:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:28,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2020715901, now seen corresponding path program 7 times [2024-05-06 01:52:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2028650292, now seen corresponding path program 7 times [2024-05-06 01:52:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:28,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash 580477238, now seen corresponding path program 7 times [2024-05-06 01:52:29,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:29,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -290786022, now seen corresponding path program 7 times [2024-05-06 01:52:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:29,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1093955593, now seen corresponding path program 7 times [2024-05-06 01:52:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:29,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:29,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1256524695, now seen corresponding path program 10 times [2024-05-06 01:52:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1148892513, now seen corresponding path program 8 times [2024-05-06 01:52:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1006874136, now seen corresponding path program 8 times [2024-05-06 01:52:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:34,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1321620731, now seen corresponding path program 8 times [2024-05-06 01:52:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:34,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1012445053, now seen corresponding path program 8 times [2024-05-06 01:52:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash -105906052, now seen corresponding path program 8 times [2024-05-06 01:52:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1213802422, now seen corresponding path program 8 times [2024-05-06 01:52:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash -99411614, now seen corresponding path program 8 times [2024-05-06 01:52:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:35,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1111603721, now seen corresponding path program 8 times [2024-05-06 01:52:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:36,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1185305275, now seen corresponding path program 2 times [2024-05-06 01:52:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash -377343856, now seen corresponding path program 2 times [2024-05-06 01:52:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -981952753, now seen corresponding path program 2 times [2024-05-06 01:52:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 938182359, now seen corresponding path program 2 times [2024-05-06 01:52:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1493652897, now seen corresponding path program 2 times [2024-05-06 01:52:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1198755191, now seen corresponding path program 2 times [2024-05-06 01:52:38,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:38,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 145622549, now seen corresponding path program 11 times [2024-05-06 01:52:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 143244813, now seen corresponding path program 9 times [2024-05-06 01:52:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1390094102, now seen corresponding path program 9 times [2024-05-06 01:52:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -654028677, now seen corresponding path program 1 times [2024-05-06 01:52:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash 948836474, now seen corresponding path program 1 times [2024-05-06 01:52:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:39,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1412309285, now seen corresponding path program 1 times [2024-05-06 01:52:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1755619440, now seen corresponding path program 1 times [2024-05-06 01:52:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash -497505489, now seen corresponding path program 1 times [2024-05-06 01:52:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1923641015, now seen corresponding path program 1 times [2024-05-06 01:52:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1863272063, now seen corresponding path program 1 times [2024-05-06 01:52:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:40,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash -771166889, now seen corresponding path program 1 times [2024-05-06 01:52:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:41,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1331004917, now seen corresponding path program 9 times [2024-05-06 01:52:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash -788348371, now seen corresponding path program 9 times [2024-05-06 01:52:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:41,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1826545930, now seen corresponding path program 9 times [2024-05-06 01:52:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash 944993435, now seen corresponding path program 1 times [2024-05-06 01:52:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1631981478, now seen corresponding path program 1 times [2024-05-06 01:52:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 524140506, now seen corresponding path program 1 times [2024-05-06 01:52:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 432612241, now seen corresponding path program 1 times [2024-05-06 01:52:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2064203794, now seen corresponding path program 1 times [2024-05-06 01:52:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1873102360, now seen corresponding path program 1 times [2024-05-06 01:52:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash -78020866, now seen corresponding path program 1 times [2024-05-06 01:52:42,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash 828778744, now seen corresponding path program 1 times [2024-05-06 01:52:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:42,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 106008726, now seen corresponding path program 9 times [2024-05-06 01:52:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash 419061612, now seen corresponding path program 9 times [2024-05-06 01:52:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1926144553, now seen corresponding path program 9 times [2024-05-06 01:52:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1635794726, now seen corresponding path program 1 times [2024-05-06 01:52:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:43,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1715232709, now seen corresponding path program 1 times [2024-05-06 01:52:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash -995380198, now seen corresponding path program 1 times [2024-05-06 01:52:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1353426769, now seen corresponding path program 1 times [2024-05-06 01:52:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash -371932114, now seen corresponding path program 1 times [2024-05-06 01:52:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 819313112, now seen corresponding path program 1 times [2024-05-06 01:52:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1550553918, now seen corresponding path program 1 times [2024-05-06 01:52:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:44,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1751085896, now seen corresponding path program 1 times [2024-05-06 01:52:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:45,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1719016166, now seen corresponding path program 1 times [2024-05-06 01:52:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:45,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1053029371, now seen corresponding path program 1 times [2024-05-06 01:52:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:45,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -271079175, now seen corresponding path program 1 times [2024-05-06 01:52:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:46,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1238243986, now seen corresponding path program 1 times [2024-05-06 01:52:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:48,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 317088973, now seen corresponding path program 1 times [2024-05-06 01:52:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:51,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash -959575719, now seen corresponding path program 1 times [2024-05-06 01:52:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:54,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1000681571, now seen corresponding path program 1 times [2024-05-06 01:52:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:56,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1833383815, now seen corresponding path program 1 times [2024-05-06 01:52:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:52:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:52:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:52:59,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:52:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:53:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash -198928619, now seen corresponding path program 12 times [2024-05-06 01:53:02,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:53:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:53:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:53:02,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:53:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:53:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 01:53:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 01:53:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 01:53:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 01:53:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable144,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable140,SelfDestructingSolverStorable80,SelfDestructingSolverStorable141,SelfDestructingSolverStorable81,SelfDestructingSolverStorable142,SelfDestructingSolverStorable82,SelfDestructingSolverStorable143,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable137,SelfDestructingSolverStorable88,SelfDestructingSolverStorable138,SelfDestructingSolverStorable89,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable131,SelfDestructingSolverStorable93,SelfDestructingSolverStorable132,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable60,SelfDestructingSolverStorable121,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable119,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable117,SelfDestructingSolverStorable68,SelfDestructingSolverStorable118,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 01:53:02,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 01:53:02,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:53:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1335042277, now seen corresponding path program 3 times [2024-05-06 01:53:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:53:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658592806] [2024-05-06 01:53:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:53:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:53:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:53:02,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:53:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:53:02,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 01:53:02,451 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 01:53:02,453 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 01:53:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 01:53:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 01:53:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 01:53:02,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 01:53:02,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 01:53:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-05-06 01:53:02,464 INFO L448 BasicCegarLoop]: Path program histogram: [12, 9, 9, 9, 9, 9, 9, 9, 9, 3, 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] [2024-05-06 01:53:02,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 01:53:02,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 01:53:02,532 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2024-05-06 01:53:02,534 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 01:53:02,535 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 01:53:02,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 01:53:02 BasicIcfg [2024-05-06 01:53:02,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 01:53:02,563 INFO L158 Benchmark]: Toolchain (without parser) took 125614.61ms. Allocated memory was 304.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 231.6MB in the beginning and 1.1GB in the end (delta: -854.9MB). Peak memory consumption was 442.3MB. Max. memory is 8.0GB. [2024-05-06 01:53:02,563 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 304.1MB. Free memory is still 270.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 01:53:02,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.82ms. Allocated memory is still 304.1MB. Free memory was 231.3MB in the beginning and 208.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-06 01:53:02,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.16ms. Allocated memory is still 304.1MB. Free memory was 207.8MB in the beginning and 205.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 01:53:02,564 INFO L158 Benchmark]: Boogie Preprocessor took 21.36ms. Allocated memory is still 304.1MB. Free memory was 205.1MB in the beginning and 203.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 01:53:02,564 INFO L158 Benchmark]: RCFGBuilder took 527.60ms. Allocated memory is still 304.1MB. Free memory was 203.3MB in the beginning and 253.5MB in the end (delta: -50.2MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2024-05-06 01:53:02,564 INFO L158 Benchmark]: TraceAbstraction took 124611.73ms. Allocated memory was 304.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 251.9MB in the beginning and 1.1GB in the end (delta: -834.5MB). Peak memory consumption was 461.5MB. Max. memory is 8.0GB. [2024-05-06 01:53:02,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 304.1MB. Free memory is still 270.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.82ms. Allocated memory is still 304.1MB. Free memory was 231.3MB in the beginning and 208.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.16ms. Allocated memory is still 304.1MB. Free memory was 207.8MB in the beginning and 205.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.36ms. Allocated memory is still 304.1MB. Free memory was 205.1MB in the beginning and 203.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 527.60ms. Allocated memory is still 304.1MB. Free memory was 203.3MB in the beginning and 253.5MB in the end (delta: -50.2MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * TraceAbstraction took 124611.73ms. Allocated memory was 304.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 251.9MB in the beginning and 1.1GB in the end (delta: -834.5MB). Peak memory consumption was 461.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation 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: 111314, independent: 110339, independent conditional: 110246, independent unconditional: 93, dependent: 975, dependent conditional: 975, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 111206, independent: 110339, independent conditional: 110246, independent unconditional: 93, dependent: 867, dependent conditional: 867, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111206, independent: 110339, independent conditional: 110246, independent unconditional: 93, dependent: 867, dependent conditional: 867, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111206, independent: 110339, independent conditional: 110246, independent unconditional: 93, dependent: 867, dependent conditional: 867, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113846, independent: 110339, independent conditional: 52247, independent unconditional: 58092, dependent: 3507, dependent conditional: 2642, dependent unconditional: 865, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113846, independent: 110339, independent conditional: 28138, independent unconditional: 82201, dependent: 3507, dependent conditional: 947, dependent unconditional: 2560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113846, independent: 110339, independent conditional: 28138, independent unconditional: 82201, dependent: 3507, dependent conditional: 947, dependent unconditional: 2560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1041, independent: 1018, independent conditional: 231, independent unconditional: 787, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1041, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 34, independent conditional: 31, independent unconditional: 3, dependent: 103, dependent conditional: 67, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 113846, independent: 109321, independent conditional: 27907, independent unconditional: 81414, dependent: 3484, dependent conditional: 936, dependent unconditional: 2548, unknown: 1041, unknown conditional: 242, unknown unconditional: 799] , Statistics on independence cache: Total cache size (in pairs): 1041, Positive cache size: 1018, Positive conditional cache size: 231, Positive unconditional cache size: 787, Negative cache size: 23, Negative conditional cache size: 11, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25804, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113846, independent: 110339, independent conditional: 52247, independent unconditional: 58092, dependent: 3507, dependent conditional: 2642, dependent unconditional: 865, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113846, independent: 110339, independent conditional: 28138, independent unconditional: 82201, dependent: 3507, dependent conditional: 947, dependent unconditional: 2560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113846, independent: 110339, independent conditional: 28138, independent unconditional: 82201, dependent: 3507, dependent conditional: 947, dependent unconditional: 2560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1041, independent: 1018, independent conditional: 231, independent unconditional: 787, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1041, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 34, independent conditional: 31, independent unconditional: 3, dependent: 103, dependent conditional: 67, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 113846, independent: 109321, independent conditional: 27907, independent unconditional: 81414, dependent: 3484, dependent conditional: 936, dependent unconditional: 2548, unknown: 1041, unknown conditional: 242, unknown unconditional: 799] , Statistics on independence cache: Total cache size (in pairs): 1041, Positive cache size: 1018, Positive conditional cache size: 231, Positive unconditional cache size: 787, Negative cache size: 23, Negative conditional cache size: 11, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25804 ], Independence queries for same thread: 108 - 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] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2516; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L773] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L802] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 820]: 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: 818]: 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, 139 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 124.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 121.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 118.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 587, ConditionalCommutativityTraceChecks: 139, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 01:53:02,589 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 01:53:02,810 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...