/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 08:42:52,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 08:42:52,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 08:42:52,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 08:42:52,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 08:42:52,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 08:42:52,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 08:42:52,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 08:42:52,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 08:42:52,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 08:42:52,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 08:42:52,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 08:42:52,421 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 08:42:52,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 08:42:52,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 08:42:52,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 08:42:52,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 08:42:52,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 08:42:52,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 08:42:52,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 08:42:52,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 08:42:52,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 08:42:52,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 08:42:52,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 08:42:52,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 08:42:52,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 08:42:52,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 08:42:52,426 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 08:42:52,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 08:42:52,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 08:42:52,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 08:42:52,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 08:42:52,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 08:42:52,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 08:42:52,429 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 08:42:52,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 08:42:52,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 08:42:52,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 08:42:52,429 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 08:42:52,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-05 08:42:52,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 08:42:52,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 08:42:52,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 08:42:52,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 08:42:52,732 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 08:42:52,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-04-05 08:42:53,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 08:42:54,083 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 08:42:54,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-04-05 08:42:54,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/261040d8a/78b5fdb06958412eb317d9333b7ee652/FLAG68e5f3595 [2024-04-05 08:42:54,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/261040d8a/78b5fdb06958412eb317d9333b7ee652 [2024-04-05 08:42:54,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 08:42:54,112 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 08:42:54,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 08:42:54,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 08:42:54,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 08:42:54,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616352ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54, skipping insertion in model container [2024-04-05 08:42:54,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 08:42:54,334 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2024-04-05 08:42:54,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 08:42:54,360 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 08:42:54,396 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2024-04-05 08:42:54,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 08:42:54,409 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 08:42:54,409 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 08:42:54,416 INFO L206 MainTranslator]: Completed translation [2024-04-05 08:42:54,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54 WrapperNode [2024-04-05 08:42:54,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 08:42:54,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 08:42:54,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 08:42:54,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 08:42:54,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,472 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 243 [2024-04-05 08:42:54,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 08:42:54,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 08:42:54,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 08:42:54,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 08:42:54,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 08:42:54,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 08:42:54,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 08:42:54,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 08:42:54,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (1/1) ... [2024-04-05 08:42:54,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 08:42:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:42:54,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 08:42:54,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 08:42:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 08:42:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 08:42:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 08:42:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 08:42:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 08:42:54,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 08:42:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 08:42:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 08:42:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-05 08:42:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-05 08:42:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 08:42:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 08:42:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 08:42:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 08:42:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 08:42:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 08:42:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 08:42:54,649 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 08:42:54,792 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 08:42:54,795 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 08:42:55,106 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 08:42:55,189 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 08:42:55,189 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2024-04-05 08:42:55,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 08:42:55 BoogieIcfgContainer [2024-04-05 08:42:55,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 08:42:55,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 08:42:55,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 08:42:55,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 08:42:55,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 08:42:54" (1/3) ... [2024-04-05 08:42:55,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa5c1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 08:42:55, skipping insertion in model container [2024-04-05 08:42:55,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:42:54" (2/3) ... [2024-04-05 08:42:55,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa5c1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 08:42:55, skipping insertion in model container [2024-04-05 08:42:55,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 08:42:55" (3/3) ... [2024-04-05 08:42:55,199 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2024-04-05 08:42:55,207 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 08:42:55,215 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 08:42:55,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 08:42:55,216 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 08:42:55,270 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-05 08:42:55,310 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 08:42:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 08:42:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:42:55,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 08:42:55,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 08:42:55,354 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 08:42:55,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:42:55,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 08:42:55,372 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;@7c75493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 08:42:55,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 08:42:55,456 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-04-05 08:42:55,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:42:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash 941376213, now seen corresponding path program 1 times [2024-04-05 08:42:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:42:55,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176134825] [2024-04-05 08:42:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:42:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:42:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:42:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:42:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:42:55,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176134825] [2024-04-05 08:42:55,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176134825] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:42:55,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:42:55,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 08:42:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41872184] [2024-04-05 08:42:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:42:55,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 08:42:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:42:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 08:42:55,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 08:42:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:55,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:42:55,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:42:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:56,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 08:42:56,006 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-04-05 08:42:56,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:42:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash -467458075, now seen corresponding path program 1 times [2024-04-05 08:42:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:42:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880873516] [2024-04-05 08:42:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:42:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:42:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:42:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:42:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:42:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880873516] [2024-04-05 08:42:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880873516] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:42:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:42:56,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 08:42:56,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467319716] [2024-04-05 08:42:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:42:56,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 08:42:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:42:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 08:42:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-04-05 08:42:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:56,528 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:42:56,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:42:56,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:56,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:42:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:42:56,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 08:42:56,733 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-04-05 08:42:56,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:42:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash 120148031, now seen corresponding path program 1 times [2024-04-05 08:42:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:42:56,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938931146] [2024-04-05 08:42:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:42:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:42:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:42:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:42:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:42:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938931146] [2024-04-05 08:42:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938931146] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 08:42:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103631296] [2024-04-05 08:42:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:42:58,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 08:42:58,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:42:58,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 08:42:58,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 08:42:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:42:58,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 08:42:58,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 08:42:58,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-04-05 08:42:58,708 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-04-05 08:42:58,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-04-05 08:42:59,193 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-04-05 08:42:59,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 08:42:59,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-04-05 08:43:00,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-05 08:43:00,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-05 08:43:01,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-05 08:43:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:43:01,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 08:43:01,612 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))))) (or (< c_~n~0 (+ .cse0 1)) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse0))) c_~i~0) (< .cse0 0))))) is different from false [2024-04-05 08:43:02,036 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (< .cse0 0) (< c_~n~0 (+ .cse0 1)) (< c_~n~0 (+ (select .cse1 (+ (* .cse0 4) c_~f~0.offset)) 2)))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1))))))) is different from false [2024-04-05 08:43:02,503 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) is different from false [2024-04-05 08:43:02,863 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2024-04-05 08:43:03,127 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-04-05 08:43:03,166 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-04-05 08:43:07,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 08:43:07,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2024-04-05 08:43:07,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 08:43:07,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 1012 [2024-04-05 08:43:07,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 08:43:07,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 480 treesize of output 404 [2024-04-05 08:43:07,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 08:43:07,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2024-04-05 08:43:07,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 08:43:07,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 175 [2024-04-05 08:43:08,980 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-04-05 08:43:08,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 1 [2024-04-05 08:43:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:43:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103631296] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 08:43:09,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 08:43:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31, 28] total 73 [2024-04-05 08:43:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957160229] [2024-04-05 08:43:09,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 08:43:09,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-04-05 08:43:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-04-05 08:43:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=3854, Unknown=55, NotChecked=810, Total=5256 [2024-04-05 08:43:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:09,569 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:09,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 5.890410958904109) internal successors, (430), 73 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:43:09,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:09,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:09,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:09,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~f~0.base)) (.cse14 (+ c_~f~0.offset (* c_~j~0 4)))) (let ((.cse0 (select .cse9 .cse14)) (.cse20 (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse29 (select .cse28 .cse14))) (or (< c_~n~0 (+ 2 (select .cse28 (+ (* .cse29 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse29 1)) (< .cse29 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse30 (select .cse31 .cse14))) (or (< c_~n~0 (+ .cse30 1)) (< (select .cse31 (+ (* .cse30 4) c_~f~0.offset)) 1) (< .cse30 0))))))) (.cse15 (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse26 (select .cse27 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse26 0) (< (select .cse27 (+ (* .cse26 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< c_~n~0 (+ .cse26 1)))))) (< c_~n~0 (+ ~i~0 1))))) (.cse21 (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse24 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~n~0 (+ (select .cse24 (+ (* .cse25 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (< .cse25 0) (< c_~n~0 (+ .cse25 1))))))))) (.cse5 (< c_~n~0 1)) (.cse6 (= c_~n~0 1))) (and (or (< c_~j~0 0) (< c_~n~0 (+ c_~j~0 1)) (= .cse0 c_~i~0)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse2 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< c_~n~0 (+ .cse1 1)) (< .cse1 0) (< c_~n~0 (+ (select .cse2 (+ (* .cse1 4) c_~f~0.offset)) 2)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< c_~n~0 (+ (select .cse4 (+ (* .cse3 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 2)))))) (< c_~n~0 (+ ~i~0 1)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8|) 0)))) .cse5 .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse8 (select .cse7 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< (select .cse7 (+ (* .cse8 4) c_~f~0.offset)) 1) (< c_~n~0 (+ .cse8 1)) (< .cse8 0))))))) (or (< c_~n~0 (+ .cse0 1)) (< .cse0 0) (= c_~i~0 (select .cse9 (+ c_~f~0.offset (* .cse0 4))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse10 (select .cse11 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse10 0) (< (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1) (< c_~n~0 (+ .cse10 1)))))))) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse13 (select .cse12 .cse14))) (or (< (select .cse12 (+ c_~f~0.offset (* 4 .cse13))) 1) (< c_~n~0 (+ .cse13 1)) (< .cse13 0))))) (or (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) .cse15 (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse16 (select .cse17 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse16 0) (< (select .cse17 (+ (* .cse16 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1) (< c_~n~0 (+ .cse16 1)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse19 (select .cse18 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~n~0 (+ 2 (select .cse18 (+ (* .cse19 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< .cse19 0) (< c_~n~0 (+ .cse19 1)))))))) (or .cse20 (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) (or .cse20 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) .cse21 (or (and .cse15 .cse21) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse22 (select .cse23 .cse14))) (or (< c_~n~0 (+ .cse22 1)) (< c_~n~0 (+ (select .cse23 (+ c_~f~0.offset (* 4 .cse22))) 2)) (< .cse22 0)))))))) is different from false [2024-04-05 08:43:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:11,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 08:43:11,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-04-05 08:43:11,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 08:43:11,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:43:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1785299303, now seen corresponding path program 2 times [2024-04-05 08:43:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:43:11,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142012421] [2024-04-05 08:43:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:43:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:43:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142012421] [2024-04-05 08:43:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142012421] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 08:43:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691111766] [2024-04-05 08:43:14,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 08:43:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 08:43:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:43:14,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 08:43:14,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 08:43:14,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-04-05 08:43:14,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 08:43:14,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 41 conjunts are in the unsatisfiable core [2024-04-05 08:43:14,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 08:43:14,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-04-05 08:43:14,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 08:43:14,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-04-05 08:43:15,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 08:43:15,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-04-05 08:43:15,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-04-05 08:43:15,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 08:43:15,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-04-05 08:43:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:15,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 08:43:15,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691111766] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:43:15,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 08:43:15,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [32] total 48 [2024-04-05 08:43:15,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43820885] [2024-04-05 08:43:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:43:15,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-04-05 08:43:15,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-04-05 08:43:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2024-04-05 08:43:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:15,933 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:15,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:43:15,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:15,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:15,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:15,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:17,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 08:43:18,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 08:43:18,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 08:43:18,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:43:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash -402900861, now seen corresponding path program 3 times [2024-04-05 08:43:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:43:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165222294] [2024-04-05 08:43:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:43:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165222294] [2024-04-05 08:43:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165222294] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:43:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:43:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-05 08:43:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927994749] [2024-04-05 08:43:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:43:18,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-05 08:43:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 08:43:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-04-05 08:43:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:18,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:18,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:43:18,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:18,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:18,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:18,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:18,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:18,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 08:43:18,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 08:43:18,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:43:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1178618859, now seen corresponding path program 4 times [2024-04-05 08:43:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:43:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55406415] [2024-04-05 08:43:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:43:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55406415] [2024-04-05 08:43:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55406415] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:43:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:43:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 08:43:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419128229] [2024-04-05 08:43:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:43:18,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 08:43:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 08:43:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 08:43:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:18,733 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:18,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:43:18,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:18,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:18,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:18,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:18,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:18,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 08:43:19,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 08:43:19,021 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 08:43:19,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:43:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -53267319, now seen corresponding path program 5 times [2024-04-05 08:43:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:43:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685767672] [2024-04-05 08:43:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:19,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:43:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685767672] [2024-04-05 08:43:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685767672] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:43:19,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:43:19,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 08:43:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903593667] [2024-04-05 08:43:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:43:19,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 08:43:19,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 08:43:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-04-05 08:43:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:43:19,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 08:43:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 08:43:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:19,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 08:43:19,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 08:43:19,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:43:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash 684790823, now seen corresponding path program 6 times [2024-04-05 08:43:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:43:19,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175360871] [2024-04-05 08:43:19,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:19,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:43:19,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175360871] [2024-04-05 08:43:19,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175360871] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:43:19,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:43:19,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 08:43:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863087767] [2024-04-05 08:43:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:43:19,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 08:43:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 08:43:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 08:43:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:19,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:43:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 08:43:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 08:43:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-04-05 08:43:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:19,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 08:43:19,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 08:43:19,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:20,735 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-04-05 08:43:20,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-04-05 08:43:20,949 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-04-05 08:43:20,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-04-05 08:43:21,354 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-04-05 08:43:21,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-04-05 08:43:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1888788359, now seen corresponding path program 1 times [2024-04-05 08:43:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:43:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:43:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:43:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 08:43:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 08:43:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-04-05 08:43:22,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable9 [2024-04-05 08:43:22,721 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@19eff268 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-05 08:43:22,725 INFO L158 Benchmark]: Toolchain (without parser) took 28613.03ms. Allocated memory was 302.0MB in the beginning and 656.4MB in the end (delta: 354.4MB). Free memory was 232.5MB in the beginning and 458.2MB in the end (delta: -225.7MB). Peak memory consumption was 129.4MB. Max. memory is 8.0GB. [2024-04-05 08:43:22,725 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 302.0MB. Free memory is still 270.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 08:43:22,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.18ms. Allocated memory is still 302.0MB. Free memory was 232.2MB in the beginning and 219.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-05 08:43:22,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 302.0MB. Free memory was 219.8MB in the beginning and 217.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 08:43:22,726 INFO L158 Benchmark]: Boogie Preprocessor took 34.13ms. Allocated memory is still 302.0MB. Free memory was 217.5MB in the beginning and 215.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 08:43:22,726 INFO L158 Benchmark]: RCFGBuilder took 672.17ms. Allocated memory is still 302.0MB. Free memory was 215.7MB in the beginning and 254.5MB in the end (delta: -38.9MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. [2024-04-05 08:43:22,727 INFO L158 Benchmark]: TraceAbstraction took 27530.95ms. Allocated memory was 302.0MB in the beginning and 656.4MB in the end (delta: 354.4MB). Free memory was 253.5MB in the beginning and 458.2MB in the end (delta: -204.7MB). Peak memory consumption was 149.7MB. Max. memory is 8.0GB. [2024-04-05 08:43:22,728 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.12ms. Allocated memory is still 302.0MB. Free memory is still 270.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.18ms. Allocated memory is still 302.0MB. Free memory was 232.2MB in the beginning and 219.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 302.0MB. Free memory was 219.8MB in the beginning and 217.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.13ms. Allocated memory is still 302.0MB. Free memory was 217.5MB in the beginning and 215.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 672.17ms. Allocated memory is still 302.0MB. Free memory was 215.7MB in the beginning and 254.5MB in the end (delta: -38.9MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. * TraceAbstraction took 27530.95ms. Allocated memory was 302.0MB in the beginning and 656.4MB in the end (delta: 354.4MB). Free memory was 253.5MB in the beginning and 458.2MB in the end (delta: -204.7MB). Peak memory consumption was 149.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@19eff268 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@19eff268: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-05 08:43:22,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 08:43:22,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...