/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 FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:31:55,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:31:55,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:31:55,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:31:55,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:31:55,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:31:55,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:31:55,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:31:55,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:31:55,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:31:55,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:31:55,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:31:55,335 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:31:55,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:31:55,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:31:55,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:31:55,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:31:55,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:31:55,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:31:55,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:31:55,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:31:55,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:31:55,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:31:55,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:31:55,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:31:55,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:31:55,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:31:55,339 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:31:55,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:31:55,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:31:55,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:31:55,341 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:31:55,342 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 -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 00:31:55,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:31:55,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:31:55,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:31:55,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:31:55,580 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:31:55,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2024-05-07 00:31:56,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:31:56,821 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:31:56,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2024-05-07 00:31:56,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/995ad9f63/ed3701222def486ca1b87577eabbe13f/FLAGc61f67ba1 [2024-05-07 00:31:56,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/995ad9f63/ed3701222def486ca1b87577eabbe13f [2024-05-07 00:31:56,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:31:56,851 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:31:56,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:31:56,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:31:56,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:31:56,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:31:56" (1/1) ... [2024-05-07 00:31:56,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d7da5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:56, skipping insertion in model container [2024-05-07 00:31:56,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:31:56" (1/1) ... [2024-05-07 00:31:56,902 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:31:57,031 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/safe005_tso.i[945,958] [2024-05-07 00:31:57,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:31:57,185 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:31:57,195 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/safe005_tso.i[945,958] [2024-05-07 00:31:57,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:31:57,277 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:31:57,277 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:31:57,283 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:31:57,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57 WrapperNode [2024-05-07 00:31:57,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:31:57,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:31:57,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:31:57,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:31:57,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,329 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-05-07 00:31:57,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:31:57,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:31:57,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:31:57,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:31:57,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:31:57,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:31:57,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:31:57,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:31:57,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (1/1) ... [2024-05-07 00:31:57,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:31:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:31:57,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 00:31:57,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 00:31:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:31:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:31:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:31:57,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:31:57,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:31:57,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:31:57,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:31:57,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:31:57,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:31:57,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 00:31:57,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 00:31:57,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:31:57,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:31:57,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:31:57,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:31:57,453 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 00:31:57,560 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:31:57,562 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:31:57,672 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:31:57,680 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:31:57,680 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:31:57,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:31:57 BoogieIcfgContainer [2024-05-07 00:31:57,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:31:57,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:31:57,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:31:57,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:31:57,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:31:56" (1/3) ... [2024-05-07 00:31:57,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba7818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:31:57, skipping insertion in model container [2024-05-07 00:31:57,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:31:57" (2/3) ... [2024-05-07 00:31:57,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba7818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:31:57, skipping insertion in model container [2024-05-07 00:31:57,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:31:57" (3/3) ... [2024-05-07 00:31:57,693 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_tso.i [2024-05-07 00:31:57,699 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:31:57,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:31:57,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:31:57,706 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:31:57,754 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:31:57,783 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:31:57,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:31:57,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:31:57,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 00:31:57,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 00:31:57,822 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:31:57,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:31:57,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:31:57,840 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;@7d6dbdf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 00:31:57,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 00:31:57,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:31:57,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:31:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash 992972723, now seen corresponding path program 1 times [2024-05-07 00:31:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:31:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015641550] [2024-05-07 00:31:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:31:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:31:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:31:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:31:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:31:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015641550] [2024-05-07 00:31:58,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015641550] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:31:58,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:31:58,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:31:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159227909] [2024-05-07 00:31:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:31:58,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:31:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:31:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:31:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:31:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:58,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:31:58,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:31:58,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:58,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:31:58,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:31:58,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:31:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 294575345, now seen corresponding path program 1 times [2024-05-07 00:31:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:31:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986658274] [2024-05-07 00:31:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:31:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:31:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:31:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:31:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:31:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986658274] [2024-05-07 00:31:58,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986658274] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:31:58,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:31:58,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:31:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571060740] [2024-05-07 00:31:58,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:31:58,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:31:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:31:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:31:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:31:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:58,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:31:58,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:31:58,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:58,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -300365394, now seen corresponding path program 1 times [2024-05-07 00:31:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:31:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:31:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:31:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:31:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:31:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:31:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:31:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:31:59,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:31:59,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 00:31:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash -231044696, now seen corresponding path program 1 times [2024-05-07 00:31:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:31:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:31:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:31:59,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:31:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:31:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 00:31:59,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 00:31:59,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:31:59,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:31:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1389294644, now seen corresponding path program 1 times [2024-05-07 00:31:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:31:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258312815] [2024-05-07 00:31:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:31:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:31:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:31:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:31:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:31:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258312815] [2024-05-07 00:31:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258312815] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:31:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:31:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:31:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960199566] [2024-05-07 00:31:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:31:59,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:31:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:31:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:31:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:31:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:59,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:31:59,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:31:59,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:31:59,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-07 00:31:59,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:32:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -231044696, now seen corresponding path program 2 times [2024-05-07 00:32:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:00,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 35289605, now seen corresponding path program 1 times [2024-05-07 00:32:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:00,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1285372599, now seen corresponding path program 1 times [2024-05-07 00:32:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:00,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1561863200, now seen corresponding path program 1 times [2024-05-07 00:32:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:01,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -514352988, now seen corresponding path program 1 times [2024-05-07 00:32:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -986422990, now seen corresponding path program 1 times [2024-05-07 00:32:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1769297975, now seen corresponding path program 1 times [2024-05-07 00:32:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 57076851, now seen corresponding path program 1 times [2024-05-07 00:32:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -552348083, now seen corresponding path program 1 times [2024-05-07 00:32:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1818931050, now seen corresponding path program 1 times [2024-05-07 00:32:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash 356968284, now seen corresponding path program 1 times [2024-05-07 00:32:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1396989445, now seen corresponding path program 1 times [2024-05-07 00:32:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1748472484, now seen corresponding path program 1 times [2024-05-07 00:32:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1467618682, now seen corresponding path program 1 times [2024-05-07 00:32:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -922486033, now seen corresponding path program 1 times [2024-05-07 00:32:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1969417541, now seen corresponding path program 1 times [2024-05-07 00:32:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1864644859, now seen corresponding path program 1 times [2024-05-07 00:32:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 355494110, now seen corresponding path program 1 times [2024-05-07 00:32:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1396942356, now seen corresponding path program 1 times [2024-05-07 00:32:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1478956979, now seen corresponding path program 1 times [2024-05-07 00:32:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash -386566400, now seen corresponding path program 1 times [2024-05-07 00:32:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 126089006, now seen corresponding path program 1 times [2024-05-07 00:32:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1104225715, now seen corresponding path program 1 times [2024-05-07 00:32:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -451177587, now seen corresponding path program 1 times [2024-05-07 00:32:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1122930825, now seen corresponding path program 1 times [2024-05-07 00:32:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 240931658, now seen corresponding path program 1 times [2024-05-07 00:32:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1393291464, now seen corresponding path program 1 times [2024-05-07 00:32:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1756138693, now seen corresponding path program 1 times [2024-05-07 00:32:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1040041303, now seen corresponding path program 1 times [2024-05-07 00:32:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1419011483, now seen corresponding path program 1 times [2024-05-07 00:32:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:04,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2008415757, now seen corresponding path program 1 times [2024-05-07 00:32:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1599921293, now seen corresponding path program 1 times [2024-05-07 00:32:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1714395101, now seen corresponding path program 1 times [2024-05-07 00:32:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 232904631, now seen corresponding path program 1 times [2024-05-07 00:32:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:32:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:32:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:32:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:32:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:32:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 00:32:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 00:32:05,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 00:32:05,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 00:32:05,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 00:32:05,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 00:32:05,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:32:05,447 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 00:32:05,448 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:32:05,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:32:05,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:32:05 BasicIcfg [2024-05-07 00:32:05,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:32:05,452 INFO L158 Benchmark]: Toolchain (without parser) took 8600.79ms. Allocated memory was 176.2MB in the beginning and 648.0MB in the end (delta: 471.9MB). Free memory was 104.1MB in the beginning and 535.0MB in the end (delta: -430.9MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2024-05-07 00:32:05,455 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:32:05,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.69ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 103.8MB in the beginning and 314.1MB in the end (delta: -210.3MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2024-05-07 00:32:05,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.26ms. Allocated memory is still 352.3MB. Free memory was 314.1MB in the beginning and 312.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:32:05,456 INFO L158 Benchmark]: Boogie Preprocessor took 31.35ms. Allocated memory is still 352.3MB. Free memory was 312.0MB in the beginning and 310.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 00:32:05,456 INFO L158 Benchmark]: RCFGBuilder took 319.47ms. Allocated memory is still 352.3MB. Free memory was 310.4MB in the beginning and 295.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 00:32:05,456 INFO L158 Benchmark]: TraceAbstraction took 7768.95ms. Allocated memory was 352.3MB in the beginning and 648.0MB in the end (delta: 295.7MB). Free memory was 294.7MB in the beginning and 535.0MB in the end (delta: -240.3MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. [2024-05-07 00:32:05,458 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.69ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 103.8MB in the beginning and 314.1MB in the end (delta: -210.3MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.26ms. Allocated memory is still 352.3MB. Free memory was 314.1MB in the beginning and 312.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.35ms. Allocated memory is still 352.3MB. Free memory was 312.0MB in the beginning and 310.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 319.47ms. Allocated memory is still 352.3MB. Free memory was 310.4MB in the beginning and 295.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7768.95ms. Allocated memory was 352.3MB in the beginning and 648.0MB in the end (delta: 295.7MB). Free memory was 294.7MB in the beginning and 535.0MB in the end (delta: -240.3MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57811, independent: 56662, independent conditional: 56501, independent unconditional: 161, dependent: 1149, dependent conditional: 1149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57643, independent: 56662, independent conditional: 56501, independent unconditional: 161, dependent: 981, dependent conditional: 981, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57643, independent: 56662, independent conditional: 56501, independent unconditional: 161, dependent: 981, dependent conditional: 981, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57643, independent: 56662, independent conditional: 56501, independent unconditional: 161, dependent: 981, dependent conditional: 981, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60097, independent: 56662, independent conditional: 26741, independent unconditional: 29921, dependent: 3435, dependent conditional: 2358, dependent unconditional: 1077, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60097, independent: 56662, independent conditional: 13311, independent unconditional: 43351, dependent: 3435, dependent conditional: 1021, dependent unconditional: 2414, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60097, independent: 56662, independent conditional: 13311, independent unconditional: 43351, dependent: 3435, dependent conditional: 1021, dependent unconditional: 2414, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1058, independent conditional: 224, independent unconditional: 834, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1037, independent conditional: 0, independent unconditional: 1037, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 59, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 60, dependent conditional: 48, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 60097, independent: 55604, independent conditional: 13087, independent unconditional: 42517, dependent: 3397, dependent conditional: 998, dependent unconditional: 2399, unknown: 1096, unknown conditional: 247, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1058, Positive conditional cache size: 224, Positive unconditional cache size: 834, Negative cache size: 38, Negative conditional cache size: 23, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14767, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60097, independent: 56662, independent conditional: 26741, independent unconditional: 29921, dependent: 3435, dependent conditional: 2358, dependent unconditional: 1077, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60097, independent: 56662, independent conditional: 13311, independent unconditional: 43351, dependent: 3435, dependent conditional: 1021, dependent unconditional: 2414, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60097, independent: 56662, independent conditional: 13311, independent unconditional: 43351, dependent: 3435, dependent conditional: 1021, dependent unconditional: 2414, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1058, independent conditional: 224, independent unconditional: 834, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1037, independent conditional: 0, independent unconditional: 1037, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 59, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 60, dependent conditional: 48, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 60097, independent: 55604, independent conditional: 13087, independent unconditional: 42517, dependent: 3397, dependent conditional: 998, dependent unconditional: 2399, unknown: 1096, unknown conditional: 247, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1058, Positive conditional cache size: 224, Positive unconditional cache size: 834, Negative cache size: 38, Negative conditional cache size: 23, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14767 ], Independence queries for same thread: 168 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 120 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 6.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 5.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 91, ConditionalCommutativityTraceChecks: 36, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 00:32:05,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-07 00:32:05,676 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...