/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 14:22:22,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 14:22:22,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 14:22:22,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 14:22:22,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 14:22:22,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 14:22:22,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 14:22:22,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 14:22:22,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 14:22:22,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 14:22:22,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 14:22:22,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 14:22:22,590 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 14:22:22,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 14:22:22,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 14:22:22,591 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 14:22:22,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 14:22:22,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 14:22:22,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 14:22:22,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 14:22:22,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 14:22:22,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 14:22:22,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 14:22:22,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 14:22:22,601 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 14:22:22,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 14:22:22,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 14:22:22,602 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 14:22:22,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 14:22:22,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:22:22,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 14:22:22,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 14:22:22,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 14:22:22,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 14:22:22,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 14:22:22,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 14:22:22,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 14:22:22,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 14:22:22,604 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 14:22:22,604 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 14:22:22,604 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/UAutomizer-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 -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 14:22:22,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 14:22:22,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 14:22:22,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 14:22:22,870 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 14:22:22,871 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 14:22:22,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 14:22:24,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 14:22:24,249 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 14:22:24,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 14:22:24,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8694e48b7/a658ac89a98e41c2bb6b5c8c019f8277/FLAG5ab632117 [2023-11-17 14:22:24,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8694e48b7/a658ac89a98e41c2bb6b5c8c019f8277 [2023-11-17 14:22:24,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 14:22:24,270 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 14:22:24,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 14:22:24,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 14:22:24,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 14:22:24,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dafb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24, skipping insertion in model container [2023-11-17 14:22:24,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 14:22:24,464 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/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 14:22:24,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:22:24,485 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 14:22:24,505 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/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 14:22:24,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:22:24,515 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 14:22:24,515 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 14:22:24,521 INFO L206 MainTranslator]: Completed translation [2023-11-17 14:22:24,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24 WrapperNode [2023-11-17 14:22:24,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 14:22:24,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 14:22:24,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 14:22:24,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 14:22:24,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,561 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 14:22:24,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 14:22:24,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 14:22:24,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 14:22:24,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 14:22:24,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 14:22:24,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 14:22:24,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 14:22:24,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 14:22:24,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (1/1) ... [2023-11-17 14:22:24,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:22:24,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:24,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 14:22:24,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 14:22:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 14:22:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 14:22:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 14:22:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 14:22:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 14:22:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 14:22:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 14:22:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 14:22:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 14:22:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 14:22:24,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 14:22:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 14:22:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 14:22:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 14:22:24,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 14:22:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 14:22:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 14:22:24,680 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 14:22:24,808 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 14:22:24,810 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 14:22:25,061 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 14:22:25,347 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 14:22:25,348 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 14:22:25,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:22:25 BoogieIcfgContainer [2023-11-17 14:22:25,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 14:22:25,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 14:22:25,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 14:22:25,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 14:22:25,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:22:24" (1/3) ... [2023-11-17 14:22:25,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@974c990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:22:25, skipping insertion in model container [2023-11-17 14:22:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:22:24" (2/3) ... [2023-11-17 14:22:25,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@974c990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:22:25, skipping insertion in model container [2023-11-17 14:22:25,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:22:25" (3/3) ... [2023-11-17 14:22:25,360 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-11-17 14:22:25,367 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 14:22:25,376 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 14:22:25,376 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 14:22:25,376 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 14:22:25,430 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 14:22:25,475 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:22:25,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 14:22:25,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:25,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 14:22:25,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 14:22:25,521 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 14:22:25,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 14:22:25,536 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;@68309d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:22:25,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 14:22:25,772 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)] === [2023-11-17 14:22:25,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 57407234, now seen corresponding path program 1 times [2023-11-17 14:22:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:25,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351347755] [2023-11-17 14:22:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 14:22:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351347755] [2023-11-17 14:22:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351347755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:22:26,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:22:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 14:22:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318939239] [2023-11-17 14:22:26,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:22:26,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 14:22:26,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:22:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 14:22:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 14:22:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:26,330 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:22:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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) [2023-11-17 14:22:26,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:26,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 14:22:26,420 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)] === [2023-11-17 14:22:26,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash -66489335, now seen corresponding path program 1 times [2023-11-17 14:22:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718643941] [2023-11-17 14:22:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:22:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718643941] [2023-11-17 14:22:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718643941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:22:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188771604] [2023-11-17 14:22:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:26,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:26,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:26,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:22:26,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 14:22:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:26,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 14:22:26,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:22:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:22:26,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:22:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:22:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188771604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:22:26,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:22:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2023-11-17 14:22:26,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862132898] [2023-11-17 14:22:26,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:22:26,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 14:22:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:22:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 14:22:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-17 14:22:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:26,919 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:22:26,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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) [2023-11-17 14:22:26,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:26,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:22:27,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 14:22:27,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-17 14:22:27,329 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)] === [2023-11-17 14:22:27,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2114696439, now seen corresponding path program 1 times [2023-11-17 14:22:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774112251] [2023-11-17 14:22:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:22:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774112251] [2023-11-17 14:22:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774112251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:22:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094209569] [2023-11-17 14:22:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:27,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:22:27,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 14:22:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:27,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 14:22:27,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:22:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:22:27,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:22:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:22:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094209569] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:22:27,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:22:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 14:22:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791607109] [2023-11-17 14:22:27,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:22:27,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 14:22:27,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:22:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 14:22:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 14:22:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:27,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:22:27,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 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) [2023-11-17 14:22:27,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:27,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:22:27,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:22:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:27,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 14:22:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:28,160 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)] === [2023-11-17 14:22:28,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1623234560, now seen corresponding path program 2 times [2023-11-17 14:22:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707281056] [2023-11-17 14:22:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:22:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707281056] [2023-11-17 14:22:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707281056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:22:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711905046] [2023-11-17 14:22:30,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 14:22:30,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:30,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:30,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:22:30,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 14:22:30,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 14:22:30,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:22:30,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 14:22:30,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:22:30,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 822 [2023-11-17 14:22:31,039 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 38 treesize of output 29 [2023-11-17 14:22:32,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:32,214 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 146 treesize of output 82 [2023-11-17 14:22:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:22:32,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:22:36,344 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse68 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse5 (= c_~min1~0 c_~min3~0)) (.cse0 (= c_~min2~0 c_~min1~0)) (.cse6 (+ c_~min3~0 1)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse2 (+ .cse68 c_~A~0.offset)) (.cse4 (+ .cse68 c_~A~0.offset 4))) (and (or (and .cse0 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (or (< (select .cse1 .cse2) c_~min2~0) (< (select .cse1 .cse3) c_~min1~0) (< (select .cse1 .cse4) c_~min3~0)))) (and .cse5 (<= .cse6 c_~min2~0))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse8 (select .cse7 .cse4))) (let ((.cse9 (+ .cse8 1))) (or (< (select .cse7 .cse2) c_~min2~0) (= c_~min1~0 .cse8) (< (select .cse7 .cse3) c_~min1~0) (< c_~min3~0 .cse9) (< c_~min2~0 .cse9)))))) (or (and (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse11 (select .cse10 .cse2))) (or (< (select .cse10 .cse3) c_~min1~0) (< (select .cse10 .cse4) c_~min3~0) (< c_~min2~0 (+ .cse11 1)) (= c_~min1~0 .cse11))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse2))) (or (< .cse12 .cse6) (< (select .cse13 .cse3) c_~min1~0) (< (select .cse13 .cse4) c_~min3~0) (< c_~min2~0 (+ .cse12 1))))))) .cse5) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse16 (select .cse15 .cse2)) (.cse14 (select .cse15 .cse3))) (or (= .cse14 c_~min3~0) (< (select .cse15 .cse4) c_~min3~0) (= .cse16 .cse14) (< c_~min2~0 (+ .cse16 1)) (< c_~min1~0 (+ .cse14 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse2))) (or (< (select .cse17 .cse3) c_~min1~0) (< (select .cse17 .cse4) c_~min3~0) (< c_~min3~0 .cse18) (< c_~min2~0 (+ .cse18 1)) (= c_~min1~0 .cse18))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse2)) (.cse19 (select .cse22 .cse4)) (.cse21 (select .cse22 .cse3))) (or (< .cse19 .cse20) (= .cse20 .cse21) (< c_~min2~0 (+ .cse20 1)) (< c_~min3~0 (+ .cse19 1)) (< c_~min1~0 (+ .cse21 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse24 (select .cse27 .cse4))) (let ((.cse25 (select .cse27 .cse2)) (.cse26 (+ .cse24 1)) (.cse23 (select .cse27 .cse3))) (or (= .cse23 .cse24) (< .cse25 .cse26) (< c_~min2~0 (+ .cse25 1)) (< c_~min3~0 .cse26) (< c_~min1~0 (+ .cse23 1))))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse4))) (let ((.cse30 (select .cse29 .cse2)) (.cse31 (+ .cse28 1))) (or (= c_~min1~0 .cse28) (< (select .cse29 .cse3) c_~min1~0) (< .cse30 .cse31) (< c_~min2~0 (+ .cse30 1)) (< c_~min3~0 .cse31)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse4)) (.cse34 (select .cse33 .cse2))) (or (= c_~min1~0 .cse32) (< (select .cse33 .cse3) c_~min1~0) (< c_~min2~0 (+ .cse34 1)) (< c_~min3~0 (+ .cse32 1)) (= c_~min1~0 .cse34))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse36 (select .cse35 .cse3))) (or (< (select .cse35 .cse2) c_~min2~0) (= .cse36 c_~min3~0) (= c_~min2~0 .cse36) (< (select .cse35 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse36 1)))))) (or .cse0 (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse38 (select .cse37 .cse4))) (or (< (select .cse37 .cse2) c_~min2~0) (= c_~min1~0 .cse38) (< (select .cse37 .cse3) c_~min1~0) (< c_~min3~0 (+ .cse38 1))))))) (or (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse40 (select .cse39 .cse3))) (or (< (select .cse39 .cse2) c_~min2~0) (= .cse40 c_~min3~0) (< (select .cse39 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse40 1)))))) (< c_~min2~0 .cse6)) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse42 (select .cse41 .cse2)) (.cse43 (select .cse41 .cse3))) (or (< (select .cse41 .cse4) c_~min3~0) (= .cse42 .cse43) (< c_~min3~0 .cse42) (< c_~min2~0 (+ .cse42 1)) (< c_~min1~0 (+ .cse43 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse45 (select .cse44 .cse4)) (.cse46 (select .cse44 .cse3))) (or (< (select .cse44 .cse2) c_~min2~0) (< .cse45 c_~min2~0) (= c_~min2~0 .cse46) (< c_~min3~0 (+ .cse45 1)) (< c_~min1~0 (+ .cse46 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse49 (select .cse47 .cse4)) (.cse48 (select .cse47 .cse3))) (or (< (select .cse47 .cse2) c_~min2~0) (= .cse48 .cse49) (= c_~min2~0 .cse48) (< c_~min3~0 (+ .cse49 1)) (< c_~min1~0 (+ .cse48 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse52 (select .cse50 .cse4))) (let ((.cse53 (+ .cse52 1)) (.cse51 (select .cse50 .cse3))) (or (< (select .cse50 .cse2) c_~min2~0) (= .cse51 .cse52) (< c_~min3~0 .cse53) (< c_~min2~0 .cse53) (< c_~min1~0 (+ .cse51 1))))))) (or (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse55 (select .cse54 .cse3))) (or (< (select .cse54 .cse2) c_~min2~0) (= c_~min2~0 .cse55) (< (select .cse54 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse55 1)))))) (< c_~min3~0 c_~min2~0)) (or .cse0 (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse56 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse57 (select .cse56 .cse4))) (or (< (select .cse56 .cse2) c_~min2~0) (< .cse57 c_~min2~0) (< (select .cse56 .cse3) c_~min1~0) (< c_~min3~0 (+ .cse57 1))))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse60 (select .cse61 .cse2)) (.cse59 (select .cse61 .cse4)) (.cse58 (select .cse61 .cse3))) (or (= .cse58 .cse59) (= .cse60 .cse58) (< c_~min2~0 (+ .cse60 1)) (< c_~min3~0 (+ .cse59 1)) (< c_~min1~0 (+ .cse58 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse63 (select .cse64 .cse2)) (.cse62 (select .cse64 .cse3))) (or (= .cse62 c_~min3~0) (< .cse63 .cse6) (< (select .cse64 .cse4) c_~min3~0) (< c_~min2~0 (+ .cse63 1)) (< c_~min1~0 (+ .cse62 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse65 (select .cse67 .cse4)) (.cse66 (select .cse67 .cse2))) (or (< .cse65 .cse66) (< (select .cse67 .cse3) c_~min1~0) (< c_~min2~0 (+ .cse66 1)) (< c_~min3~0 (+ .cse65 1)) (= c_~min1~0 .cse66)))))))) is different from false [2023-11-17 14:22:36,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse13 (+ c_~min3~0 1)) (.cse29 (= c_~min1~0 c_~min3~0)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse4 (+ c_~A~0.offset 4))) (and (or .cse0 (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse4))) (or (< (select .cse1 .cse2) c_~min1~0) (< c_~min3~0 (+ .cse3 1)) (< (select .cse1 c_~A~0.offset) c_~min2~0) (= c_~min1~0 .cse3)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset)) (.cse7 (select .cse6 .cse4))) (or (< c_~min2~0 (+ .cse5 1)) (= c_~min1~0 .cse5) (< (select .cse6 .cse2) c_~min1~0) (< .cse7 .cse5) (< c_~min3~0 (+ .cse7 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse11 (select .cse9 .cse4))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse10 (+ .cse11 1))) (or (< c_~min2~0 (+ .cse8 1)) (< (select .cse9 .cse2) c_~min1~0) (< c_~min3~0 .cse10) (< .cse8 .cse10) (= c_~min1~0 .cse11)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse12 (select .cse15 c_~A~0.offset)) (.cse14 (select .cse15 .cse2))) (or (< .cse12 .cse13) (= .cse14 c_~min3~0) (< c_~min2~0 (+ .cse12 1)) (< (select .cse15 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse14 1)))))) (or .cse0 (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse4))) (or (< .cse16 c_~min2~0) (< (select .cse17 .cse2) c_~min1~0) (< c_~min3~0 (+ .cse16 1)) (< (select .cse17 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset)) (.cse18 (select .cse20 .cse2))) (or (= .cse18 .cse19) (< c_~min2~0 (+ .cse19 1)) (< c_~min3~0 .cse19) (< (select .cse20 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse18 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse4)) (.cse21 (select .cse23 .cse2))) (or (= c_~min2~0 .cse21) (< c_~min3~0 (+ .cse22 1)) (= .cse21 .cse22) (< (select .cse23 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse21 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse2))) (or (= .cse24 c_~min3~0) (= c_~min2~0 .cse24) (< (select .cse25 c_~A~0.offset) c_~min2~0) (< (select .cse25 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse24 1)))))) (or (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse26 (select .cse27 .cse2))) (or (= .cse26 c_~min3~0) (< (select .cse27 c_~A~0.offset) c_~min2~0) (< (select .cse27 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse26 1)))))) (< c_~min2~0 .cse13)) (or (and .cse0 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (or (< (select .cse28 .cse2) c_~min1~0) (< (select .cse28 c_~A~0.offset) c_~min2~0) (< (select .cse28 .cse4) c_~min3~0)))) (and .cse29 (<= .cse13 c_~min2~0))) (or (and (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (< .cse30 .cse13) (< c_~min2~0 (+ .cse30 1)) (< (select .cse31 .cse2) c_~min1~0) (< (select .cse31 .cse4) c_~min3~0))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse32 (select .cse33 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse32 1)) (= c_~min1~0 .cse32) (< (select .cse33 .cse2) c_~min1~0) (< (select .cse33 .cse4) c_~min3~0)))))) .cse29) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse34 (select .cse35 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse34 1)) (< c_~min3~0 .cse34) (= c_~min1~0 .cse34) (< (select .cse35 .cse2) c_~min1~0) (< (select .cse35 .cse4) c_~min3~0))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse4))) (let ((.cse38 (select .cse40 .cse2)) (.cse36 (select .cse40 c_~A~0.offset)) (.cse37 (+ .cse39 1))) (or (< c_~min2~0 (+ .cse36 1)) (< c_~min3~0 .cse37) (= .cse38 .cse39) (< c_~min1~0 (+ .cse38 1)) (< .cse36 .cse37)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse4)) (.cse41 (select .cse43 .cse2))) (or (= c_~min2~0 .cse41) (< .cse42 c_~min2~0) (< c_~min3~0 (+ .cse42 1)) (< (select .cse43 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse41 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse44 (select .cse45 c_~A~0.offset)) (.cse46 (select .cse45 .cse4))) (or (< c_~min2~0 (+ .cse44 1)) (= c_~min1~0 .cse44) (< (select .cse45 .cse2) c_~min1~0) (< c_~min3~0 (+ .cse46 1)) (= c_~min1~0 .cse46))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse49 (select .cse50 .cse4))) (let ((.cse47 (+ .cse49 1)) (.cse48 (select .cse50 .cse2))) (or (< c_~min2~0 .cse47) (< c_~min3~0 .cse47) (= .cse48 .cse49) (< (select .cse50 c_~A~0.offset) c_~min2~0) (< c_~min1~0 (+ .cse48 1))))))) (or (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse2))) (or (= c_~min2~0 .cse51) (< (select .cse52 c_~A~0.offset) c_~min2~0) (< (select .cse52 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse51 1)))))) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse56 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse54 (select .cse56 c_~A~0.offset)) (.cse55 (select .cse56 .cse4)) (.cse53 (select .cse56 .cse2))) (or (= .cse53 .cse54) (< c_~min2~0 (+ .cse54 1)) (< .cse55 .cse54) (< c_~min3~0 (+ .cse55 1)) (< c_~min1~0 (+ .cse53 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse60 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse58 (select .cse60 c_~A~0.offset)) (.cse59 (select .cse60 .cse4)) (.cse57 (select .cse60 .cse2))) (or (= .cse57 .cse58) (< c_~min2~0 (+ .cse58 1)) (< c_~min3~0 (+ .cse59 1)) (= .cse57 .cse59) (< c_~min1~0 (+ .cse57 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse62 (select .cse63 c_~A~0.offset)) (.cse61 (select .cse63 .cse2))) (or (= .cse61 .cse62) (= .cse61 c_~min3~0) (< c_~min2~0 (+ .cse62 1)) (< (select .cse63 .cse4) c_~min3~0) (< c_~min1~0 (+ .cse61 1)))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_122) c_~A~0.base))) (let ((.cse66 (select .cse65 .cse4))) (let ((.cse64 (+ .cse66 1))) (or (< c_~min2~0 .cse64) (< (select .cse65 .cse2) c_~min1~0) (< c_~min3~0 .cse64) (< (select .cse65 c_~A~0.offset) c_~min2~0) (= c_~min1~0 .cse66)))))))) is different from false [2023-11-17 14:22:37,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3020 treesize of output 2308 [2023-11-17 14:22:37,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,209 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 2226 treesize of output 2230 [2023-11-17 14:22:37,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,302 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 2211 treesize of output 2215 [2023-11-17 14:22:37,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,403 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 2196 treesize of output 2193 [2023-11-17 14:22:37,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,502 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 2174 treesize of output 2169 [2023-11-17 14:22:37,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,593 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 2150 treesize of output 2138 [2023-11-17 14:22:37,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,717 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 2119 treesize of output 2110 [2023-11-17 14:22:37,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,836 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 2091 treesize of output 2089 [2023-11-17 14:22:37,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:37,948 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 2070 treesize of output 2065 [2023-11-17 14:22:38,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,056 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 2046 treesize of output 2038 [2023-11-17 14:22:38,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,165 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 2019 treesize of output 2015 [2023-11-17 14:22:38,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,283 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 1996 treesize of output 1998 [2023-11-17 14:22:38,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,414 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 1979 treesize of output 1979 [2023-11-17 14:22:38,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,526 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 1960 treesize of output 1962 [2023-11-17 14:22:38,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,645 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 1943 treesize of output 1934 [2023-11-17 14:22:38,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,760 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 1915 treesize of output 1905 [2023-11-17 14:22:38,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:38,895 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 1886 treesize of output 1885 [2023-11-17 14:22:39,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:39,062 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 1866 treesize of output 1865 [2023-11-17 14:22:39,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:39,215 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 1846 treesize of output 1848 [2023-11-17 14:22:39,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:39,361 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 1829 treesize of output 1815 [2023-11-17 14:22:39,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:39,506 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 1796 treesize of output 1785 [2023-11-17 14:22:39,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:39,638 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 1766 treesize of output 1764 [2023-11-17 14:22:39,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:22:39,766 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 1745 treesize of output 1751 [2023-11-17 14:24:43,629 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 14:24:43,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-17 14:24:43,632 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 14:24:43,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-17 14:24:43,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:24:43,833 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-17 14:24:43,836 INFO L158 Benchmark]: Toolchain (without parser) took 139566.60ms. Allocated memory was 195.0MB in the beginning and 830.5MB in the end (delta: 635.4MB). Free memory was 143.7MB in the beginning and 485.7MB in the end (delta: -342.0MB). Peak memory consumption was 495.9MB. Max. memory is 8.0GB. [2023-11-17 14:24:43,837 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 14:24:43,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.85ms. Allocated memory is still 195.0MB. Free memory was 143.7MB in the beginning and 131.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 14:24:43,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.05ms. Allocated memory is still 195.0MB. Free memory was 131.8MB in the beginning and 130.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 14:24:43,839 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 195.0MB. Free memory was 130.0MB in the beginning and 128.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 14:24:43,839 INFO L158 Benchmark]: RCFGBuilder took 762.07ms. Allocated memory was 195.0MB in the beginning and 270.5MB in the end (delta: 75.5MB). Free memory was 128.2MB in the beginning and 216.8MB in the end (delta: -88.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-11-17 14:24:43,839 INFO L158 Benchmark]: TraceAbstraction took 138484.04ms. Allocated memory was 270.5MB in the beginning and 830.5MB in the end (delta: 559.9MB). Free memory was 215.8MB in the beginning and 485.7MB in the end (delta: -269.9MB). Peak memory consumption was 491.7MB. Max. memory is 8.0GB. [2023-11-17 14:24:43,843 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.11ms. Allocated memory is still 195.0MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.85ms. Allocated memory is still 195.0MB. Free memory was 143.7MB in the beginning and 131.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.05ms. Allocated memory is still 195.0MB. Free memory was 131.8MB in the beginning and 130.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 195.0MB. Free memory was 130.0MB in the beginning and 128.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 762.07ms. Allocated memory was 195.0MB in the beginning and 270.5MB in the end (delta: 75.5MB). Free memory was 128.2MB in the beginning and 216.8MB in the end (delta: -88.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 138484.04ms. Allocated memory was 270.5MB in the beginning and 830.5MB in the end (delta: 559.9MB). Free memory was 215.8MB in the beginning and 485.7MB in the end (delta: -269.9MB). Peak memory consumption was 491.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-17 14:24:43,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...