/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 RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 04:32:44,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 04:32:44,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 04:32:44,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 04:32:44,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 04:32:44,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 04:32:44,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 04:32:44,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 04:32:44,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 04:32:44,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 04:32:44,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 04:32:44,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 04:32:44,792 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 04:32:44,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 04:32:44,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 04:32:44,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 04:32:44,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 04:32:44,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 04:32:44,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 04:32:44,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 04:32:44,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 04:32:44,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 04:32:44,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 04:32:44,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 04:32:44,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 04:32:44,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 04:32:44,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 04:32:44,797 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 04:32:44,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 04:32:44,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 04:32:44,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 04:32:44,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 04:32:44,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 04:32:44,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 04:32:44,799 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 04:32:44,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 04:32:44,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 04:32:44,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 04:32:44,814 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 04:32:44,814 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-05 04:32:45,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 04:32:45,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 04:32:45,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 04:32:45,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 04:32:45,088 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 04:32:45,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2024-04-05 04:32:46,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 04:32:46,548 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 04:32:46,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2024-04-05 04:32:46,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2938ec827/93b35dfdab124c05a066e51ce7d7a3e6/FLAG7d885028b [2024-04-05 04:32:46,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2938ec827/93b35dfdab124c05a066e51ce7d7a3e6 [2024-04-05 04:32:46,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 04:32:46,585 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 04:32:46,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 04:32:46,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 04:32:46,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 04:32:46,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:32:46" (1/1) ... [2024-04-05 04:32:46,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72bbaa4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:46, skipping insertion in model container [2024-04-05 04:32:46,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:32:46" (1/1) ... [2024-04-05 04:32:46,644 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 04:32:46,796 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2024-04-05 04:32:47,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 04:32:47,030 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 04:32:47,041 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2024-04-05 04:32:47,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 04:32:47,196 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 04:32:47,196 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 04:32:47,203 INFO L206 MainTranslator]: Completed translation [2024-04-05 04:32:47,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47 WrapperNode [2024-04-05 04:32:47,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 04:32:47,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 04:32:47,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 04:32:47,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 04:32:47,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,342 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-04-05 04:32:47,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 04:32:47,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 04:32:47,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 04:32:47,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 04:32:47,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 04:32:47,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 04:32:47,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 04:32:47,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 04:32:47,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (1/1) ... [2024-04-05 04:32:47,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 04:32:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 04:32:47,441 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-05 04:32:47,451 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-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-04-05 04:32:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-04-05 04:32:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-04-05 04:32:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-04-05 04:32:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-04-05 04:32:47,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-04-05 04:32:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-04-05 04:32:47,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-04-05 04:32:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 04:32:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 04:32:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 04:32:47,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 04:32:47,485 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 04:32:47,617 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 04:32:47,620 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 04:32:47,898 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 04:32:48,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 04:32:48,039 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-05 04:32:48,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:32:48 BoogieIcfgContainer [2024-04-05 04:32:48,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 04:32:48,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 04:32:48,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 04:32:48,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 04:32:48,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 04:32:46" (1/3) ... [2024-04-05 04:32:48,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef8dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:32:48, skipping insertion in model container [2024-04-05 04:32:48,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:32:47" (2/3) ... [2024-04-05 04:32:48,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef8dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:32:48, skipping insertion in model container [2024-04-05 04:32:48,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:32:48" (3/3) ... [2024-04-05 04:32:48,055 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2024-04-05 04:32:48,063 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 04:32:48,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 04:32:48,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-05 04:32:48,072 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 04:32:48,136 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 04:32:48,183 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 04:32:48,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 04:32:48,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 04:32:48,187 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-05 04:32:48,189 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-05 04:32:48,216 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 04:32:48,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 04:32:48,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 04:32:48,237 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;@2f73ce91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213 [2024-04-05 04:32:48,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 04:32:48,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 04:32:48,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 04:32:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1200048375, now seen corresponding path program 1 times [2024-04-05 04:32:48,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 04:32:48,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84400185] [2024-04-05 04:32:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:32:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:32:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:32:49,313 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-05 04:32:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 04:32:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84400185] [2024-04-05 04:32:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84400185] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 04:32:49,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 04:32:49,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 04:32:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509248366] [2024-04-05 04:32:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 04:32:49,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 04:32:49,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 04:32:49,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 04:32:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 04:32:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:32:49,357 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 04:32:49,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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-05 04:32:49,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:32:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 04:32:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 04:32:49,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 04:32:49,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 04:32:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1763865265, now seen corresponding path program 1 times [2024-04-05 04:32:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 04:32:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488241487] [2024-04-05 04:32:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:32:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:32:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:32:49,952 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-05 04:32:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 04:32:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488241487] [2024-04-05 04:32:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488241487] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 04:32:49,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 04:32:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-05 04:32:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494189468] [2024-04-05 04:32:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 04:32:49,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-05 04:32:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 04:32:49,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-05 04:32:49,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-04-05 04:32:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:32:49,959 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 04:32:49,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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-05 04:32:49,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 04:32:49,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:32:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 04:32:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 04:32:50,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 04:32:50,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 04:32:50,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 04:32:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash -851811529, now seen corresponding path program 1 times [2024-04-05 04:32:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 04:32:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003718596] [2024-04-05 04:32:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:32:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:32:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:32:50,551 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-05 04:32:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 04:32:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003718596] [2024-04-05 04:32:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003718596] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 04:32:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 04:32:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 04:32:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888750117] [2024-04-05 04:32:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 04:32:50,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 04:32:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 04:32:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 04:32:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-04-05 04:32:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:32:50,556 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 04:32:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-05 04:32:50,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 04:32:50,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 04:32:50,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:32:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 1 times [2024-04-05 04:32:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:32:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:32:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:32:53,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:32:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:32:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 1 times [2024-04-05 04:32:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:32:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:32:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:32:53,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:32:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1436532797, now seen corresponding path program 1 times [2024-04-05 04:33:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:06,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash 647858376, now seen corresponding path program 1 times [2024-04-05 04:33:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:16,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1362308824, now seen corresponding path program 1 times [2024-04-05 04:33:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:25,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2034862080, now seen corresponding path program 1 times [2024-04-05 04:33:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:34,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 607278302, now seen corresponding path program 1 times [2024-04-05 04:33:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:33:35,692 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-05 04:33:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:33:35,819 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-05 04:33:35,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 04:33:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-04-05 04:33:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 1 times [2024-04-05 04:33:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:36,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 609086299, now seen corresponding path program 1 times [2024-04-05 04:33:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:36,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 2 times [2024-04-05 04:33:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:37,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 2 times [2024-04-05 04:33:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:37,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 839787199, now seen corresponding path program 1 times [2024-04-05 04:33:46,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:46,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:46,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 647858376, now seen corresponding path program 2 times [2024-04-05 04:33:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:56,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 04:33:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 04:33:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 04:33:59,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-04-05 04:33:59,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 04:33:59,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 04:33:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1157342217, now seen corresponding path program 2 times [2024-04-05 04:33:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 04:33:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599023902] [2024-04-05 04:33:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:33:59,534 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-05 04:33:59,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 04:33:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599023902] [2024-04-05 04:33:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599023902] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 04:33:59,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 04:33:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-05 04:33:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698494373] [2024-04-05 04:33:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 04:33:59,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-05 04:33:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 04:33:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 04:33:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-04-05 04:33:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:33:59,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 04:33:59,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-05 04:33:59,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 04:33:59,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 04:33:59,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 04:33:59,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 04:33:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 2 times [2024-04-05 04:33:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:33:59,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:33:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:33:59,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:33:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash 609086299, now seen corresponding path program 2 times [2024-04-05 04:34:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:00,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash 839787199, now seen corresponding path program 2 times [2024-04-05 04:34:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:09,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:09,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash 776003673, now seen corresponding path program 1 times [2024-04-05 04:34:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:18,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1436532797, now seen corresponding path program 2 times [2024-04-05 04:34:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:28,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 647858376, now seen corresponding path program 3 times [2024-04-05 04:34:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:34,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1362308824, now seen corresponding path program 2 times [2024-04-05 04:34:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:44,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2034862080, now seen corresponding path program 2 times [2024-04-05 04:34:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:34:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:34:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:34:52,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:34:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -210081842, now seen corresponding path program 1 times [2024-04-05 04:35:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:01,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1095663065, now seen corresponding path program 1 times [2024-04-05 04:35:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:01,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash 575628482, now seen corresponding path program 1 times [2024-04-05 04:35:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:35:10,824 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-05 04:35:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 04:35:11,062 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-05 04:35:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 04:35:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-04-05 04:35:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash 757979443, now seen corresponding path program 3 times [2024-04-05 04:35:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:11,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 401281690, now seen corresponding path program 3 times [2024-04-05 04:35:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:12,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2039877489, now seen corresponding path program 3 times [2024-04-05 04:35:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:12,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1095663065, now seen corresponding path program 2 times [2024-04-05 04:35:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:13,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2007794832, now seen corresponding path program 1 times [2024-04-05 04:35:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 04:35:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 04:35:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:58,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 04:35:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 04:35:58,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28 [2024-04-05 04:35:58,699 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@354cea07 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-05 04:35:58,703 INFO L158 Benchmark]: Toolchain (without parser) took 192118.16ms. Allocated memory was 267.4MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 194.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-04-05 04:35:58,704 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 267.4MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 04:35:58,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.46ms. Allocated memory is still 267.4MB. Free memory was 194.4MB in the beginning and 233.6MB in the end (delta: -39.3MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2024-04-05 04:35:58,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.09ms. Allocated memory is still 267.4MB. Free memory was 233.6MB in the beginning and 231.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 04:35:58,705 INFO L158 Benchmark]: Boogie Preprocessor took 34.69ms. Allocated memory is still 267.4MB. Free memory was 231.0MB in the beginning and 228.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 04:35:58,705 INFO L158 Benchmark]: RCFGBuilder took 661.73ms. Allocated memory is still 267.4MB. Free memory was 228.9MB in the beginning and 192.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2024-04-05 04:35:58,707 INFO L158 Benchmark]: TraceAbstraction took 190659.93ms. Allocated memory was 267.4MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 191.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-04-05 04:35:58,709 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.14ms. Allocated memory is still 267.4MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 630.46ms. Allocated memory is still 267.4MB. Free memory was 194.4MB in the beginning and 233.6MB in the end (delta: -39.3MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 126.09ms. Allocated memory is still 267.4MB. Free memory was 233.6MB in the beginning and 231.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.69ms. Allocated memory is still 267.4MB. Free memory was 231.0MB in the beginning and 228.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 661.73ms. Allocated memory is still 267.4MB. Free memory was 228.9MB in the beginning and 192.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 190659.93ms. Allocated memory was 267.4MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 191.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. 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@354cea07 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@354cea07: 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-05 04:35:58,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-05 04:35:59,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...