/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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 01:54:46,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 01:54:46,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 01:54:46,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 01:54:46,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 01:54:46,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 01:54:46,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 01:54:46,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 01:54:46,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 01:54:46,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 01:54:46,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 01:54:46,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 01:54:46,221 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 01:54:46,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 01:54:46,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 01:54:46,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 01:54:46,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 01:54:46,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 01:54:46,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 01:54:46,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 01:54:46,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 01:54:46,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 01:54:46,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 01:54:46,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 01:54:46,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 01:54:46,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 01:54:46,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 01:54:46,225 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 01:54:46,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 01:54:46,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 01:54:46,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 01:54:46,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 01:54:46,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 01:54:46,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 01:54:46,227 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 01:54:46,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 01:54:46,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 01:54:46,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 01:54:46,227 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 01:54:46,227 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-04-04 01:54:46,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 01:54:46,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 01:54:46,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 01:54:46,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 01:54:46,458 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 01:54:46,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-04-04 01:54:47,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 01:54:47,728 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 01:54:47,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-04-04 01:54:47,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/46e6b70da/5e0324f805244a349d74a35a4232ca1d/FLAG1a6563ed4 [2024-04-04 01:54:47,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/46e6b70da/5e0324f805244a349d74a35a4232ca1d [2024-04-04 01:54:47,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 01:54:47,753 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 01:54:47,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 01:54:47,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 01:54:47,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 01:54:47,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 01:54:47" (1/1) ... [2024-04-04 01:54:47,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6768b222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:47, skipping insertion in model container [2024-04-04 01:54:47,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 01:54:47" (1/1) ... [2024-04-04 01:54:47,806 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 01:54:47,921 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-04-04 01:54:48,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 01:54:48,101 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 01:54:48,113 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-04-04 01:54:48,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 01:54:48,201 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 01:54:48,201 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 01:54:48,207 INFO L206 MainTranslator]: Completed translation [2024-04-04 01:54:48,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48 WrapperNode [2024-04-04 01:54:48,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 01:54:48,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 01:54:48,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 01:54:48,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 01:54:48,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,272 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-04-04 01:54:48,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 01:54:48,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 01:54:48,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 01:54:48,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 01:54:48,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 01:54:48,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 01:54:48,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 01:54:48,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 01:54:48,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (1/1) ... [2024-04-04 01:54:48,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 01:54:48,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:54:48,357 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-04-04 01:54:48,380 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-04-04 01:54:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 01:54:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-04 01:54:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 01:54:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 01:54:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 01:54:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-04-04 01:54:48,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-04-04 01:54:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-04-04 01:54:48,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-04-04 01:54:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-04-04 01:54:48,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-04-04 01:54:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 01:54:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-04 01:54:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 01:54:48,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 01:54:48,402 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 01:54:48,543 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 01:54:48,547 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 01:54:48,816 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 01:54:48,917 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 01:54:48,917 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-04 01:54:48,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 01:54:48 BoogieIcfgContainer [2024-04-04 01:54:48,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 01:54:48,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 01:54:48,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 01:54:48,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 01:54:48,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 01:54:47" (1/3) ... [2024-04-04 01:54:48,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66baa257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 01:54:48, skipping insertion in model container [2024-04-04 01:54:48,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 01:54:48" (2/3) ... [2024-04-04 01:54:48,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66baa257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 01:54:48, skipping insertion in model container [2024-04-04 01:54:48,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 01:54:48" (3/3) ... [2024-04-04 01:54:48,924 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-04-04 01:54:48,930 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 01:54:48,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 01:54:48,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-04 01:54:48,937 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 01:54:48,983 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-04 01:54:49,022 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 01:54:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 01:54:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:54:49,025 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-04-04 01:54:49,040 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-04-04 01:54:49,058 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 01:54:49,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:54:49,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 01:54:49,081 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;@612092d2, 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 [2024-04-04 01:54:49,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-04 01:54:49,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-04 01:54:49,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:54:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 340703837, now seen corresponding path program 1 times [2024-04-04 01:54:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:54:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776526684] [2024-04-04 01:54:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:54:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:54:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:54:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:54:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:54:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776526684] [2024-04-04 01:54:49,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776526684] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:54:49,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:54:49,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 01:54:49,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112770899] [2024-04-04 01:54:49,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:54:49,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 01:54:49,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:54:49,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 01:54:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 01:54:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:49,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:54:49,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 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-04-04 01:54:49,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:49,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 01:54:49,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-04 01:54:49,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:54:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -273098809, now seen corresponding path program 1 times [2024-04-04 01:54:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:54:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240259612] [2024-04-04 01:54:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:54:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:54:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:54:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:54:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:54:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240259612] [2024-04-04 01:54:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240259612] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:54:50,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:54:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-04 01:54:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589998378] [2024-04-04 01:54:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:54:50,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-04 01:54:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:54:50,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-04 01:54:50,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-04 01:54:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,434 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:54:50,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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-04-04 01:54:50,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 01:54:50,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 01:54:50,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-04 01:54:50,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:54:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 900634969, now seen corresponding path program 1 times [2024-04-04 01:54:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:54:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407607299] [2024-04-04 01:54:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:54:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:54:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:54:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:54:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:54:50,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407607299] [2024-04-04 01:54:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407607299] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:54:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:54:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 01:54:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503101310] [2024-04-04 01:54:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:54:50,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 01:54:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:54:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 01:54:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-04-04 01:54:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,733 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:54:50,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 01:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 01:54:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 01:54:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-04 01:54:50,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 01:54:50,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-04 01:54:50,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:54:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash -485976043, now seen corresponding path program 1 times [2024-04-04 01:54:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:54:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081623772] [2024-04-04 01:54:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:54:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:54:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:54:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:54:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:54:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081623772] [2024-04-04 01:54:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081623772] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 01:54:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 01:54:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-04 01:54:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834787426] [2024-04-04 01:54:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 01:54:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-04 01:54:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 01:54:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-04 01:54:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-04-04 01:54:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:51,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 01:54:51,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 01:54:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 01:54:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-04-04 01:54:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:54:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1769681289, now seen corresponding path program 1 times [2024-04-04 01:54:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:54:59,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:54:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:54:59,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:54:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash 974455237, now seen corresponding path program 1 times [2024-04-04 01:55:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:55:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:55:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:55:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 01:55:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-04 01:55:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-04-04 01:55:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1769681289, now seen corresponding path program 2 times [2024-04-04 01:55:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:08,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 360344917, now seen corresponding path program 1 times [2024-04-04 01:55:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:16,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -402496672, now seen corresponding path program 1 times [2024-04-04 01:55:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:22,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1927217078, now seen corresponding path program 1 times [2024-04-04 01:55:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:30,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash -627736269, now seen corresponding path program 1 times [2024-04-04 01:55:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:36,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash 257353508, now seen corresponding path program 1 times [2024-04-04 01:55:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:43,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 148280980, now seen corresponding path program 1 times [2024-04-04 01:55:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:50,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash 837231053, now seen corresponding path program 1 times [2024-04-04 01:55:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:55:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:55:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:55:57,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:55:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2026532476, now seen corresponding path program 1 times [2024-04-04 01:56:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:04,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1179764560, now seen corresponding path program 1 times [2024-04-04 01:56:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:11,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash -590724955, now seen corresponding path program 1 times [2024-04-04 01:56:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:18,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash 951313873, now seen corresponding path program 1 times [2024-04-04 01:56:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:25,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1003350968, now seen corresponding path program 1 times [2024-04-04 01:56:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:32,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2111084543, now seen corresponding path program 1 times [2024-04-04 01:56:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:40,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2009194073, now seen corresponding path program 1 times [2024-04-04 01:56:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:47,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1312902504, now seen corresponding path program 1 times [2024-04-04 01:56:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:56:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:56:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:56:54,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:56:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash -358048872, now seen corresponding path program 1 times [2024-04-04 01:57:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:02,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1929902100, now seen corresponding path program 1 times [2024-04-04 01:57:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:09,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash -213318463, now seen corresponding path program 1 times [2024-04-04 01:57:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:17,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2071866933, now seen corresponding path program 1 times [2024-04-04 01:57:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:24,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash 69666516, now seen corresponding path program 1 times [2024-04-04 01:57:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:32,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash -828528285, now seen corresponding path program 1 times [2024-04-04 01:57:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:39,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2103504779, now seen corresponding path program 1 times [2024-04-04 01:57:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:47,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2144901172, now seen corresponding path program 1 times [2024-04-04 01:57:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:57:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:57:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:57:54,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:57:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1907145917, now seen corresponding path program 1 times [2024-04-04 01:58:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:02,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1310236239, now seen corresponding path program 1 times [2024-04-04 01:58:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:10,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2034423002, now seen corresponding path program 1 times [2024-04-04 01:58:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:19,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 627648304, now seen corresponding path program 1 times [2024-04-04 01:58:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:26,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1362394503, now seen corresponding path program 1 times [2024-04-04 01:58:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:34,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1151818466, now seen corresponding path program 1 times [2024-04-04 01:58:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:41,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1559744166, now seen corresponding path program 1 times [2024-04-04 01:58:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:48,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash 89396807, now seen corresponding path program 1 times [2024-04-04 01:58:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:58:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:58:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:56,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 01:58:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 01:58:58,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-04 01:58:58,804 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@206f458a at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-04 01:58:58,808 INFO L158 Benchmark]: Toolchain (without parser) took 251054.78ms. Allocated memory was 290.5MB in the beginning and 880.8MB in the end (delta: 590.3MB). Free memory was 222.0MB in the beginning and 811.0MB in the end (delta: -589.1MB). Peak memory consumption was 527.7MB. Max. memory is 8.0GB. [2024-04-04 01:58:58,808 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 01:58:58,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.87ms. Allocated memory is still 290.5MB. Free memory was 222.0MB in the beginning and 198.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-04-04 01:58:58,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.52ms. Allocated memory is still 290.5MB. Free memory was 198.3MB in the beginning and 195.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-04 01:58:58,809 INFO L158 Benchmark]: Boogie Preprocessor took 32.99ms. Allocated memory is still 290.5MB. Free memory was 195.7MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:58:58,809 INFO L158 Benchmark]: RCFGBuilder took 610.98ms. Allocated memory is still 290.5MB. Free memory was 193.6MB in the beginning and 233.2MB in the end (delta: -39.5MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2024-04-04 01:58:58,810 INFO L158 Benchmark]: TraceAbstraction took 249887.59ms. Allocated memory was 290.5MB in the beginning and 880.8MB in the end (delta: 590.3MB). Free memory was 232.1MB in the beginning and 811.0MB in the end (delta: -578.9MB). Peak memory consumption was 536.8MB. Max. memory is 8.0GB. [2024-04-04 01:58:58,811 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.13ms. Allocated memory is still 181.4MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 453.87ms. Allocated memory is still 290.5MB. Free memory was 222.0MB in the beginning and 198.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.52ms. Allocated memory is still 290.5MB. Free memory was 198.3MB in the beginning and 195.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.99ms. Allocated memory is still 290.5MB. Free memory was 195.7MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 610.98ms. Allocated memory is still 290.5MB. Free memory was 193.6MB in the beginning and 233.2MB in the end (delta: -39.5MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 249887.59ms. Allocated memory was 290.5MB in the beginning and 880.8MB in the end (delta: 590.3MB). Free memory was 232.1MB in the beginning and 811.0MB in the end (delta: -578.9MB). Peak memory consumption was 536.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@206f458a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@206f458a: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-04 01:58:58,836 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-04-04 01:58:59,080 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...