/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --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/safe002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 21:18:43,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 21:18:43,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 21:18:44,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 21:18:44,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 21:18:44,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 21:18:44,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 21:18:44,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 21:18:44,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 21:18:44,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 21:18:44,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 21:18:44,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 21:18:44,017 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 21:18:44,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 21:18:44,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 21:18:44,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 21:18:44,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 21:18:44,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 21:18:44,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 21:18:44,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 21:18:44,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 21:18:44,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 21:18:44,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 21:18:44,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 21:18:44,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 21:18:44,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 21:18:44,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 21:18:44,021 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 21:18:44,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 21:18:44,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:18:44,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 21:18:44,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 21:18:44,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 21:18:44,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 21:18:44,023 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 21:18:44,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 21:18:44,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 21:18:44,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 21:18:44,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 21:18:44,023 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 21:18:44,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 21:18:44,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 21:18:44,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 21:18:44,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 21:18:44,242 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 21:18:44,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2024-05-07 21:18:45,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 21:18:45,614 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 21:18:45,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2024-05-07 21:18:45,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f75598164/d3c819a180a348939efe0556c07bc491/FLAG8cc8ded24 [2024-05-07 21:18:45,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f75598164/d3c819a180a348939efe0556c07bc491 [2024-05-07 21:18:45,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 21:18:45,645 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 21:18:45,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 21:18:45,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 21:18:45,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 21:18:45,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:18:45" (1/1) ... [2024-05-07 21:18:45,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3060ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:45, skipping insertion in model container [2024-05-07 21:18:45,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 09:18:45" (1/1) ... [2024-05-07 21:18:45,696 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 21:18:45,840 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/safe002_rmo.oepc.i[993,1006] [2024-05-07 21:18:46,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:18:46,042 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 21:18:46,052 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/safe002_rmo.oepc.i[993,1006] [2024-05-07 21:18:46,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 21:18:46,140 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 21:18:46,140 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 21:18:46,146 INFO L206 MainTranslator]: Completed translation [2024-05-07 21:18:46,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46 WrapperNode [2024-05-07 21:18:46,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 21:18:46,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 21:18:46,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 21:18:46,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 21:18:46,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,191 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-05-07 21:18:46,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 21:18:46,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 21:18:46,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 21:18:46,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 21:18:46,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 21:18:46,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 21:18:46,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 21:18:46,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 21:18:46,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (1/1) ... [2024-05-07 21:18:46,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 21:18:46,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:18:46,290 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 21:18:46,308 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 21:18:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 21:18:46,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 21:18:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 21:18:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 21:18:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 21:18:46,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 21:18:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 21:18:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 21:18:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 21:18:46,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 21:18:46,336 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 21:18:46,466 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 21:18:46,468 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 21:18:46,867 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 21:18:47,083 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 21:18:47,083 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 21:18:47,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:18:47 BoogieIcfgContainer [2024-05-07 21:18:47,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 21:18:47,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 21:18:47,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 21:18:47,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 21:18:47,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 09:18:45" (1/3) ... [2024-05-07 21:18:47,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7f34d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:18:47, skipping insertion in model container [2024-05-07 21:18:47,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 09:18:46" (2/3) ... [2024-05-07 21:18:47,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7f34d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 09:18:47, skipping insertion in model container [2024-05-07 21:18:47,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 09:18:47" (3/3) ... [2024-05-07 21:18:47,096 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2024-05-07 21:18:47,103 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 21:18:47,111 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 21:18:47,111 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 21:18:47,111 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 21:18:47,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 21:18:47,200 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 21:18:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 21:18:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 21:18:47,244 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 21:18:47,254 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 21:18:47,278 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 21:18:47,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:18:47,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 21:18:47,295 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;@71d93158, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 21:18:47,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 21:18:47,340 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 21:18:47,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:18:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1176701882, now seen corresponding path program 1 times [2024-05-07 21:18:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:18:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410703539] [2024-05-07 21:18:47,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:18:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:18:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:18:47,769 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 21:18:47,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:18:47,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410703539] [2024-05-07 21:18:47,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410703539] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:18:47,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:18:47,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 21:18:47,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124008212] [2024-05-07 21:18:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:18:47,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 21:18:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:18:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 21:18:47,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 21:18:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:18:47,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:18:47,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 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 21:18:47,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:18:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:18:47,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 21:18:47,891 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 21:18:47,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:18:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1391347588, now seen corresponding path program 1 times [2024-05-07 21:18:47,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:18:47,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663993024] [2024-05-07 21:18:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:18:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:18:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:18:48,651 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 21:18:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:18:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663993024] [2024-05-07 21:18:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663993024] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:18:48,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:18:48,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 21:18:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773383410] [2024-05-07 21:18:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:18:48,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 21:18:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:18:48,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 21:18:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 21:18:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:18:48,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:18:48,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:18:48,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:18:48,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:28:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:04,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:04,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 21:28:04,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-05-07 21:28:04,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1528365076, now seen corresponding path program 1 times [2024-05-07 21:28:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:28:07,781 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 21:28:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:28:08,068 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 21:28:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 21:28:08,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 21:28:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash -937809376, now seen corresponding path program 1 times [2024-05-07 21:28:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:08,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:28:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 21:28:08,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 21:28:08,470 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 21:28:08,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 21:28:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1528629402, now seen corresponding path program 1 times [2024-05-07 21:28:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 21:28:08,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220427698] [2024-05-07 21:28:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:28:08,910 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 21:28:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 21:28:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220427698] [2024-05-07 21:28:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220427698] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 21:28:08,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 21:28:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 21:28:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714235667] [2024-05-07 21:28:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 21:28:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 21:28:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 21:28:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -937809376, now seen corresponding path program 2 times [2024-05-07 21:28:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 21:28:09,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-05-07 21:28:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:28:09,069 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 21:28:09,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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 21:28:09,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:28:09,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-07 21:28:09,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 21:28:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -937809376, now seen corresponding path program 3 times [2024-05-07 21:28:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1387242026, now seen corresponding path program 1 times [2024-05-07 21:28:09,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1352325503, now seen corresponding path program 1 times [2024-05-07 21:28:09,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:09,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:18,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:18,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:18,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:18,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:18,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:18,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:28:18,684 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-05-07 21:28:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 70026108, now seen corresponding path program 1 times [2024-05-07 21:28:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:28:21,240 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 21:28:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:28:21,655 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 21:28:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-07 21:28:21,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-05-07 21:28:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash -937809376, now seen corresponding path program 4 times [2024-05-07 21:28:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:21,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1387242026, now seen corresponding path program 2 times [2024-05-07 21:28:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:22,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1352325503, now seen corresponding path program 2 times [2024-05-07 21:28:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:28:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:28:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:28:22,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:28:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:04,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1065274950, now seen corresponding path program 1 times [2024-05-07 21:29:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:08,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:09,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -242730935, now seen corresponding path program 1 times [2024-05-07 21:29:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:14,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:14,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:15,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1116208642, now seen corresponding path program 1 times [2024-05-07 21:29:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:19,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:21,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1975669311, now seen corresponding path program 1 times [2024-05-07 21:29:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:25,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:26,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 906100054, now seen corresponding path program 1 times [2024-05-07 21:29:31,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:31,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:32,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1968891710, now seen corresponding path program 1 times [2024-05-07 21:29:36,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:36,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:37,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash 63512651, now seen corresponding path program 1 times [2024-05-07 21:29:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:42,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:43,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:29:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash -413593131, now seen corresponding path program 1 times [2024-05-07 21:29:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:29:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:29:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:29:47,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:29:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:31:29,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:31:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1527816048, now seen corresponding path program 1 times [2024-05-07 21:31:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:31:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:31:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:31:29,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:31:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:31:35,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:31:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash 240881235, now seen corresponding path program 1 times [2024-05-07 21:31:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:31:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:31:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:31:39,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:31:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:31:40,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 21:31:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 423412380, now seen corresponding path program 1 times [2024-05-07 21:31:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:31:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:31:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:31:45,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:31:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:10,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1307190947, now seen corresponding path program 1 times [2024-05-07 21:32:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:11,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:12,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash -235296049, now seen corresponding path program 1 times [2024-05-07 21:32:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:13,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:15,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 851954114, now seen corresponding path program 1 times [2024-05-07 21:32:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:15,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:16,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 660 treesize of output 612 [2024-05-07 21:32:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash -278842282, now seen corresponding path program 1 times [2024-05-07 21:32:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:16,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:32:16,668 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 21:32:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 21:32:16,718 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 21:32:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 21:32:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2024-05-07 21:32:18,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1527816048, now seen corresponding path program 2 times [2024-05-07 21:32:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:18,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:20,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1307190947, now seen corresponding path program 2 times [2024-05-07 21:32:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:20,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:22,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash -235296049, now seen corresponding path program 2 times [2024-05-07 21:32:22,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:22,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:24,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-05-07 21:32:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 851954114, now seen corresponding path program 2 times [2024-05-07 21:32:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 21:32:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 21:32:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 21:32:24,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 21:32:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat Received shutdown request... [2024-05-07 21:32:48,409 WARN L235 SmtUtils]: Removed 2 from assertion stack [2024-05-07 21:32:48,409 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,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 21:32:48,409 WARN L619 AbstractCegarLoop]: Verification canceled: while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 11ms.. [2024-05-07 21:32:48,411 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 21:32:48,412 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 21:32:48,412 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 21:32:48,412 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 21:32:48,418 INFO L448 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 21:32:48,419 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: clock still running: ConditionalCommutativityCheckTime at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.getValue(CegarLoopStatisticsGenerator.java:172) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.aggregateBenchmarkData(StatisticsData.java:60) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:418) 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-05-07 21:32:48,421 INFO L158 Benchmark]: Toolchain (without parser) took 842776.40ms. Allocated memory was 346.0MB in the beginning and 1.3GB in the end (delta: 993.0MB). Free memory was 313.7MB in the beginning and 632.7MB in the end (delta: -319.0MB). Peak memory consumption was 854.7MB. Max. memory is 8.0GB. [2024-05-07 21:32:48,422 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 163.0MB in the beginning and 162.9MB in the end (delta: 88.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 21:32:48,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.78ms. Allocated memory is still 346.0MB. Free memory was 313.2MB in the beginning and 287.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-05-07 21:32:48,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.78ms. Allocated memory is still 346.0MB. Free memory was 287.5MB in the beginning and 284.3MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 21:32:48,423 INFO L158 Benchmark]: Boogie Preprocessor took 26.71ms. Allocated memory is still 346.0MB. Free memory was 284.3MB in the beginning and 281.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 21:32:48,423 INFO L158 Benchmark]: RCFGBuilder took 865.67ms. Allocated memory is still 346.0MB. Free memory was 281.7MB in the beginning and 198.4MB in the end (delta: 83.4MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2024-05-07 21:32:48,424 INFO L158 Benchmark]: TraceAbstraction took 841331.50ms. Allocated memory was 346.0MB in the beginning and 1.3GB in the end (delta: 993.0MB). Free memory was 196.8MB in the beginning and 632.7MB in the end (delta: -435.9MB). Peak memory consumption was 738.3MB. Max. memory is 8.0GB. [2024-05-07 21:32:48,424 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 163.0MB in the beginning and 162.9MB in the end (delta: 88.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.78ms. Allocated memory is still 346.0MB. Free memory was 313.2MB in the beginning and 287.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.78ms. Allocated memory is still 346.0MB. Free memory was 287.5MB in the beginning and 284.3MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.71ms. Allocated memory is still 346.0MB. Free memory was 284.3MB in the beginning and 281.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 865.67ms. Allocated memory is still 346.0MB. Free memory was 281.7MB in the beginning and 198.4MB in the end (delta: 83.4MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. * TraceAbstraction took 841331.50ms. Allocated memory was 346.0MB in the beginning and 1.3GB in the end (delta: 993.0MB). Free memory was 196.8MB in the beginning and 632.7MB in the end (delta: -435.9MB). Peak memory consumption was 738.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 34165, independent: 33702, independent conditional: 33463, independent unconditional: 239, dependent: 463, dependent conditional: 463, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34140, independent: 33702, independent conditional: 33463, independent unconditional: 239, dependent: 438, dependent conditional: 438, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34140, independent: 33702, independent conditional: 33463, independent unconditional: 239, dependent: 438, dependent conditional: 438, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34140, independent: 33702, independent conditional: 33463, independent unconditional: 239, dependent: 438, dependent conditional: 438, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35557, independent: 33702, independent conditional: 16154, independent unconditional: 17548, dependent: 1855, dependent conditional: 1422, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35557, independent: 33702, independent conditional: 10573, independent unconditional: 23129, dependent: 1855, dependent conditional: 779, dependent unconditional: 1076, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35557, independent: 33702, independent conditional: 10573, independent unconditional: 23129, dependent: 1855, dependent conditional: 779, dependent unconditional: 1076, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 811, independent: 772, independent conditional: 211, independent unconditional: 561, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 811, independent: 755, independent conditional: 0, independent unconditional: 755, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 440, independent: 44, independent conditional: 43, independent unconditional: 2, dependent: 396, dependent conditional: 291, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 35557, independent: 32930, independent conditional: 10362, independent unconditional: 22568, dependent: 1816, dependent conditional: 754, dependent unconditional: 1062, unknown: 811, unknown conditional: 236, unknown unconditional: 575] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 772, Positive conditional cache size: 211, Positive unconditional cache size: 561, Negative cache size: 39, Negative conditional cache size: 25, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6224, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35557, independent: 33702, independent conditional: 16154, independent unconditional: 17548, dependent: 1855, dependent conditional: 1422, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35557, independent: 33702, independent conditional: 10573, independent unconditional: 23129, dependent: 1855, dependent conditional: 779, dependent unconditional: 1076, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35557, independent: 33702, independent conditional: 10573, independent unconditional: 23129, dependent: 1855, dependent conditional: 779, dependent unconditional: 1076, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 811, independent: 772, independent conditional: 211, independent unconditional: 561, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 811, independent: 755, independent conditional: 0, independent unconditional: 755, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 440, independent: 44, independent conditional: 43, independent unconditional: 2, dependent: 396, dependent conditional: 291, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 35557, independent: 32930, independent conditional: 10362, independent unconditional: 22568, dependent: 1816, dependent conditional: 754, dependent unconditional: 1062, unknown: 811, unknown conditional: 236, unknown unconditional: 575] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 772, Positive conditional cache size: 211, Positive unconditional cache size: 561, Negative cache size: 39, Negative conditional cache size: 25, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6224 ], Independence queries for same thread: 25 - ExceptionOrErrorResult: AssertionError: clock still running: ConditionalCommutativityCheckTime de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: clock still running: ConditionalCommutativityCheckTime: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.getValue(CegarLoopStatisticsGenerator.java:172) [2024-05-07 21:32:48,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 21:32:48,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown