/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:28:35,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:28:35,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:28:35,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:28:35,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:28:35,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:28:35,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:28:35,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:28:35,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:28:35,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:28:35,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:28:35,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:28:35,081 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:28:35,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:28:35,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:28:35,082 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:28:35,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:28:35,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:28:35,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:28:35,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:28:35,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:28:35,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:28:35,086 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:28:35,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:28:35,087 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:28:35,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:28:35,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:28:35,087 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:28:35,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:28:35,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:28:35,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:28:35,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:28:35,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:28:35,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:28:35,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:28:35,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:28:35,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:28:35,089 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:28:35,089 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:28:35,089 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:28:35,089 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 [2023-11-17 18:28:35,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:28:35,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:28:35,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:28:35,273 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:28:35,273 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:28:35,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-17 18:28:36,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:28:36,331 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:28:36,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-17 18:28:36,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16870e931/fc37ca1d585040b8ba89115db7b52717/FLAG9e40825dd [2023-11-17 18:28:36,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16870e931/fc37ca1d585040b8ba89115db7b52717 [2023-11-17 18:28:36,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:28:36,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:28:36,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:28:36,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:28:36,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:28:36,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc80b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36, skipping insertion in model container [2023-11-17 18:28:36,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:28:36,479 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-max-array-hom.wvr.c[2625,2638] [2023-11-17 18:28:36,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:28:36,493 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:28:36,509 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-max-array-hom.wvr.c[2625,2638] [2023-11-17 18:28:36,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:28:36,519 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:28:36,519 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:28:36,524 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:28:36,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36 WrapperNode [2023-11-17 18:28:36,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:28:36,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:28:36,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:28:36,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:28:36,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 06:28:36" (1/1) ... [2023-11-17 18:28:36,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,547 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 18:28:36,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:28:36,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:28:36,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:28:36,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:28:36,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:28:36,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:28:36,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:28:36,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:28:36,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (1/1) ... [2023-11-17 18:28:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:28:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:28:36,601 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 18:28:36,609 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 18:28:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:28:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:28:36,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:28:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:28:36,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:28:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 18:28:36,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 18:28:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:28:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:28:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:28:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 18:28:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 18:28:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:28:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:28:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:28:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:28:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:28:36,628 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 18:28:36,728 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:28:36,729 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:28:36,944 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:28:36,988 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:28:36,989 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 18:28:36,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:28:36 BoogieIcfgContainer [2023-11-17 18:28:36,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:28:36,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:28:36,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:28:36,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:28:36,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:28:36" (1/3) ... [2023-11-17 18:28:36,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141ef5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:28:36, skipping insertion in model container [2023-11-17 18:28:36,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:28:36" (2/3) ... [2023-11-17 18:28:36,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141ef5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:28:36, skipping insertion in model container [2023-11-17 18:28:36,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:28:36" (3/3) ... [2023-11-17 18:28:36,995 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-11-17 18:28:37,000 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:28:37,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:28:37,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:28:37,009 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:28:37,059 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 18:28:37,086 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:28:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:28:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:28:37,089 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 18:28:37,092 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 18:28:37,118 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:28:37,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:28:37,129 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;@697d073a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:28:37,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 18:28:37,315 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 18:28:37,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:28:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1043430592, now seen corresponding path program 1 times [2023-11-17 18:28:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:28:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329659780] [2023-11-17 18:28:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:28:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-17 18:28:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:28:37,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329659780] [2023-11-17 18:28:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329659780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:28:37,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:28:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:28:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382748250] [2023-11-17 18:28:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:28:37,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:28:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:28:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:28:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:28:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:37,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:28:37,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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 18:28:37,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:37,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:28:37,599 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 18:28:37,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:28:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1944192509, now seen corresponding path program 1 times [2023-11-17 18:28:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:28:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677963746] [2023-11-17 18:28:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:28:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 18:28:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:28:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677963746] [2023-11-17 18:28:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677963746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:28:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:28:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 18:28:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534662259] [2023-11-17 18:28:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:28:37,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 18:28:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:28:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 18:28:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 18:28:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:37,966 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:28:37,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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 18:28:37,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:37,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:28:38,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 18:28:38,111 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 18:28:38,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:28:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1205075594, now seen corresponding path program 1 times [2023-11-17 18:28:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:28:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680734354] [2023-11-17 18:28:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:28:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:28:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:28:38,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680734354] [2023-11-17 18:28:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680734354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:28:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540133318] [2023-11-17 18:28:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:38,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:28:38,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:28:38,439 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 18:28:38,470 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 18:28:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:38,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 18:28:38,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:28:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:28:38,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:28:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:28:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540133318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:28:39,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:28:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-17 18:28:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009171237] [2023-11-17 18:28:39,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:28:39,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 18:28:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:28:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 18:28:39,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-17 18:28:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:39,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:28:39,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 24 states have internal predecessors, (196), 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 18:28:39,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:39,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:28:39,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:28:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:28:39,262 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 18:28:39,461 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,SelfDestructingSolverStorable2 [2023-11-17 18:28:39,462 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 18:28:39,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:28:39,462 INFO L85 PathProgramCache]: Analyzing trace with hash -794594321, now seen corresponding path program 2 times [2023-11-17 18:28:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:28:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633287156] [2023-11-17 18:28:39,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:39,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:28:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:28:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:28:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633287156] [2023-11-17 18:28:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633287156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:28:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900542681] [2023-11-17 18:28:39,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:28:39,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:28:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:28:39,704 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 18:28:39,720 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 18:28:39,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-17 18:28:39,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:28:39,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 18:28:39,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:28:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-17 18:28:40,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 18:28:40,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900542681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:28:40,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 18:28:40,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2023-11-17 18:28:40,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767638656] [2023-11-17 18:28:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:28:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 18:28:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:28:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 18:28:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-17 18:28:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:40,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:28:40,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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 18:28:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:40,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:28:40,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:28:40,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:28:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:28:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:28:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 18:28:40,141 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 18:28:40,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:28:40,331 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)] === [2023-11-17 18:28:40,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:28:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1967343428, now seen corresponding path program 1 times [2023-11-17 18:28:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:28:40,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683056128] [2023-11-17 18:28:40,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:28:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:28:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:28:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683056128] [2023-11-17 18:28:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683056128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:28:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658756086] [2023-11-17 18:28:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:28:44,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:28:44,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:28:44,857 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 18:28:44,860 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 18:28:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:28:44,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-17 18:28:44,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:28:45,002 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 [2023-11-17 18:28:45,050 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 18:28:45,051 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 [2023-11-17 18:28:45,255 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-17 18:28:45,255 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 [2023-11-17 18:28:46,348 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 36 treesize of output 27 [2023-11-17 18:28:47,365 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 133 treesize of output 102 [2023-11-17 18:28:48,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:48,258 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 72 [2023-11-17 18:28:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:28:48,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:28:53,367 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~max2~0 1))) (let ((.cse26 (= c_~max1~0 c_~max2~0)) (.cse51 (< c_~max2~0 c_~max3~0)) (.cse44 (= c_~max1~0 c_~max3~0)) (.cse37 (< c_~max3~0 .cse7)) (.cse2 (+ c_~max3~0 1)) (.cse4 (+ c_~A~0.offset 4)) (.cse9 (+ c_~max1~0 1)) (.cse6 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_#t~post1| 4) 4))) (and (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse5 (select .cse3 c_~A~0.base))) (let ((.cse1 (select .cse5 c_~A~0.offset))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse0 (+ .cse1 1)) (< .cse0 .cse2) (= c_~max1~0 .cse0)))) (< c_~max1~0 (select .cse5 .cse6)) (< .cse1 .cse7)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse12 (select .cse11 c_~A~0.base))) (let ((.cse8 (select .cse12 .cse6))) (or (< .cse8 .cse9) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse10) (< .cse10 .cse2)))) (< c_~max2~0 (select .cse12 c_~A~0.offset)) (= c_~max2~0 .cse8)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse16 (select .cse15 c_~A~0.base))) (let ((.cse13 (select .cse16 c_~A~0.offset))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse13 .cse14) (< .cse14 .cse2)))) (< c_~max1~0 (select .cse16 .cse6)) (= .cse13 c_~max1~0) (< .cse13 .cse7)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse20 (select .cse18 c_~A~0.base))) (let ((.cse17 (select .cse20 .cse6)) (.cse19 (select .cse20 c_~A~0.offset))) (or (= c_~max3~0 .cse17) (< c_~max3~0 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max3~0 (+ .cse19 1)) (< .cse17 .cse9) (< .cse19 .cse7)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse25 (select .cse23 c_~A~0.base))) (let ((.cse24 (select .cse25 .cse6)) (.cse21 (select .cse25 c_~A~0.offset))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse21 .cse22) (< .cse22 .cse2)))) (= .cse21 .cse24) (< .cse24 .cse9) (< .cse21 .cse7)))))) (or .cse26 (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (.cse28 (select .cse29 c_~A~0.base))) (or (< c_~max2~0 .cse27) (< .cse27 .cse2) (< c_~max2~0 (select .cse28 c_~A~0.offset)) (< c_~max1~0 (select .cse28 .cse6))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse33 (select .cse32 c_~A~0.base))) (let ((.cse31 (select .cse33 .cse6)) (.cse30 (select .cse33 c_~A~0.offset))) (or (= .cse30 .cse31) (< .cse30 c_~max3~0) (< c_~max3~0 (select (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< .cse31 .cse9) (< .cse30 .cse7)))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse36 (select .cse35 c_~A~0.base))) (let ((.cse34 (select .cse36 .cse6))) (or (= c_~max3~0 .cse34) (< c_~max3~0 (select (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< .cse34 .cse9) (< c_~max2~0 (select .cse36 c_~A~0.offset))))))) .cse37) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse40 (select .cse39 c_~A~0.base))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse38 .cse7) (< .cse38 .cse2) (= c_~max1~0 .cse38)))) (< c_~max2~0 (select .cse40 c_~A~0.offset)) (< c_~max1~0 (select .cse40 .cse6)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse43 (select .cse42 c_~A~0.base))) (let ((.cse41 (select .cse43 c_~A~0.offset))) (or (< .cse41 c_~max3~0) (< c_~max3~0 (select (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max1~0 (select .cse43 .cse6)) (= .cse41 c_~max1~0) (< .cse41 .cse7)))))) (or .cse44 (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse47 (select .cse45 c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max3~0 (+ .cse46 1)) (< c_~max1~0 (select .cse47 .cse6)) (< .cse46 .cse7))))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse50 (select .cse48 c_~A~0.base))) (let ((.cse49 (select .cse50 .cse6))) (or (< c_~max3~0 (select (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< .cse49 .cse9) (< c_~max2~0 (select .cse50 c_~A~0.offset)) (= c_~max2~0 .cse49)))))) .cse51) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse53 (select .cse52 c_~A~0.base))) (or (< c_~max3~0 (select (select (store .cse52 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max2~0 (select .cse53 c_~A~0.offset)) (< c_~max1~0 (select .cse53 .cse6)))))) (and (or .cse26 .cse51) (or .cse44 .cse37))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse55 (select .cse57 c_~A~0.base))) (let ((.cse54 (select .cse55 .cse6))) (or (< .cse54 .cse9) (< c_~max2~0 (select .cse55 c_~A~0.offset)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse56 .cse7) (= .cse56 .cse54) (< .cse56 .cse2))))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse62 (select .cse61 c_~A~0.base))) (let ((.cse60 (select .cse62 .cse6)) (.cse59 (select .cse62 c_~A~0.offset))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse58 (select (select (store .cse61 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse58 (+ .cse59 1)) (= .cse58 .cse60) (< .cse58 .cse2)))) (< .cse60 .cse9) (< .cse59 .cse7))))))))) is different from false [2023-11-17 18:28:53,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~max2~0 1))) (let ((.cse0 (= c_~max1~0 c_~max3~0)) (.cse11 (< c_~max3~0 .cse6)) (.cse24 (< c_~max2~0 c_~max3~0)) (.cse23 (= c_~max1~0 c_~max2~0)) (.cse8 (+ c_~max1~0 1)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse18 (+ c_~max3~0 1)) (.cse4 (+ c_~A~0.offset 4))) (and (or .cse0 (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse1 (select .cse3 c_~A~0.base))) (let ((.cse5 (select .cse1 c_~A~0.offset))) (or (< c_~max1~0 (select .cse1 .cse2)) (< c_~max3~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max3~0 (+ .cse5 1)) (< .cse5 .cse6))))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse10 (select .cse9 c_~A~0.base))) (let ((.cse7 (select .cse10 .cse2))) (or (< .cse7 .cse8) (< c_~max3~0 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max2~0 (select .cse10 c_~A~0.offset)) (= .cse7 c_~max3~0)))))) .cse11) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse15 (select .cse14 c_~A~0.base))) (let ((.cse13 (select .cse15 .cse2)) (.cse12 (select .cse15 c_~A~0.offset))) (or (< .cse12 c_~max3~0) (< .cse13 .cse8) (< c_~max3~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (= .cse13 .cse12) (< .cse12 .cse6)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse20 (select .cse19 c_~A~0.base))) (let ((.cse16 (select .cse20 .cse2))) (or (< .cse16 .cse8) (= .cse16 c_~max2~0) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse17 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse17) (< .cse17 .cse18)))) (< c_~max2~0 (select .cse20 c_~A~0.offset))))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse21 (select .cse22 c_~A~0.base))) (or (< c_~max1~0 (select .cse21 .cse2)) (< c_~max3~0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max2~0 (select .cse21 c_~A~0.offset)))))) (and (or .cse23 .cse24) (or .cse0 .cse11))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse28 (select .cse26 c_~A~0.base))) (let ((.cse25 (select .cse28 .cse2)) (.cse27 (select .cse28 c_~A~0.offset))) (or (< .cse25 .cse8) (< c_~max3~0 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (< c_~max3~0 (+ .cse27 1)) (= .cse25 c_~max3~0) (< .cse27 .cse6)))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse31 (select .cse30 c_~A~0.base))) (let ((.cse29 (select .cse31 .cse2))) (or (< .cse29 .cse8) (< c_~max3~0 (select (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (= .cse29 c_~max2~0) (< c_~max2~0 (select .cse31 c_~A~0.offset))))))) .cse24) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse32 (select .cse34 c_~A~0.base))) (or (< c_~max1~0 (select .cse32 .cse2)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse33 (select (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse33 .cse6) (< .cse33 .cse18) (= c_~max1~0 .cse33)))) (< c_~max2~0 (select .cse32 c_~A~0.offset)))))) (or .cse23 (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse36 (select (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (.cse35 (select .cse37 c_~A~0.base))) (or (< c_~max1~0 (select .cse35 .cse2)) (< c_~max2~0 .cse36) (< .cse36 .cse18) (< c_~max2~0 (select .cse35 c_~A~0.offset))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse38 (select .cse41 c_~A~0.base))) (let ((.cse39 (select .cse38 c_~A~0.offset))) (or (< c_~max1~0 (select .cse38 .cse2)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse40 (select (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse39 .cse40) (< .cse40 .cse18)))) (= .cse39 c_~max1~0) (< .cse39 .cse6)))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse42 (select .cse44 c_~A~0.base))) (let ((.cse43 (select .cse42 c_~A~0.offset))) (or (< c_~max1~0 (select .cse42 .cse2)) (< .cse43 c_~max3~0) (< c_~max3~0 (select (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4)) (= .cse43 c_~max1~0) (< .cse43 .cse6)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse49 (select .cse48 c_~A~0.base))) (let ((.cse45 (select .cse49 .cse2)) (.cse47 (select .cse49 c_~A~0.offset))) (or (< .cse45 .cse8) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse46 (select (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse46 (+ .cse47 1)) (< .cse46 .cse18) (= .cse45 .cse46)))) (< .cse47 .cse6)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse53 (select .cse52 c_~A~0.base))) (let ((.cse51 (select .cse53 .cse2))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse50 (select (select (store .cse52 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse50 .cse6) (< .cse50 .cse18) (= .cse51 .cse50)))) (< .cse51 .cse8) (< c_~max2~0 (select .cse53 c_~A~0.offset))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse58 (select .cse56 c_~A~0.base))) (let ((.cse57 (select .cse58 .cse2)) (.cse54 (select .cse58 c_~A~0.offset))) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse55 (select (select (store .cse56 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse54 .cse55) (< .cse55 .cse18)))) (< .cse57 .cse8) (= .cse57 .cse54) (< .cse54 .cse6)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse59 (select .cse62 c_~A~0.base))) (let ((.cse61 (select .cse59 c_~A~0.offset))) (or (< c_~max1~0 (select .cse59 .cse2)) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse60 (select (select (store .cse62 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136) c_~A~0.base) .cse4))) (or (< .cse60 (+ .cse61 1)) (< .cse60 .cse18) (= c_~max1~0 .cse60)))) (< .cse61 .cse6))))))))) is different from false [2023-11-17 18:28:53,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:53,988 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 5260 treesize of output 4435 [2023-11-17 18:28:54,106 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 2497 treesize of output 2473 [2023-11-17 18:28:54,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,172 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 2473 treesize of output 2457 [2023-11-17 18:28:54,223 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 2438 treesize of output 2430 [2023-11-17 18:28:54,268 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 2430 treesize of output 2422 [2023-11-17 18:28:54,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,336 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 2422 treesize of output 2428 [2023-11-17 18:28:54,383 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 2409 treesize of output 2401 [2023-11-17 18:28:54,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,457 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 2401 treesize of output 2405 [2023-11-17 18:28:54,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,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 2386 treesize of output 2384 [2023-11-17 18:28:54,581 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 2365 treesize of output 2341 [2023-11-17 18:28:54,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,652 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 2341 treesize of output 2338 [2023-11-17 18:28:54,708 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 2319 treesize of output 2311 [2023-11-17 18:28:54,762 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 2311 treesize of output 2303 [2023-11-17 18:28:54,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,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 2303 treesize of output 2305 [2023-11-17 18:28:54,898 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 2286 treesize of output 2270 [2023-11-17 18:28:54,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:54,977 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 2270 treesize of output 2250 [2023-11-17 18:28:55,036 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 2231 treesize of output 2207 [2023-11-17 18:28:55,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:55,120 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 2207 treesize of output 2202 [2023-11-17 18:28:55,181 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 2183 treesize of output 2175 [2023-11-17 18:28:55,250 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 2175 treesize of output 2159 [2023-11-17 18:28:55,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:55,331 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 2159 treesize of output 2155 [2023-11-17 18:28:55,394 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 2136 treesize of output 2128 [2023-11-17 18:28:55,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:55,479 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 2128 treesize of output 2130 [2023-11-17 18:28:55,549 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 2111 treesize of output 2095 [2023-11-17 18:28:55,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:55,637 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 2095 treesize of output 2084 [2023-11-17 18:28:55,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:55,728 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 2065 treesize of output 2064 [2023-11-17 18:28:55,806 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 2045 treesize of output 2021 [2023-11-17 18:28:55,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:55,901 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 2021 treesize of output 2015 [2023-11-17 18:28:56,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:56,001 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 1991 [2023-11-17 18:28:56,085 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 1972 treesize of output 1956 [2023-11-17 18:28:56,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:28:56,193 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 1956 treesize of output 1955 [2023-11-17 18:30:54,683 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 18:30:54,683 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 18:30:54,684 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 18:30:54,689 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 18:30:54,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:30:54,889 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 18:30:54,892 INFO L158 Benchmark]: Toolchain (without parser) took 138544.59ms. Allocated memory was 186.6MB in the beginning and 720.4MB in the end (delta: 533.7MB). Free memory was 153.6MB in the beginning and 337.6MB in the end (delta: -184.0MB). Peak memory consumption was 438.9MB. Max. memory is 8.0GB. [2023-11-17 18:30:54,892 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:30:54,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.32ms. Allocated memory is still 186.6MB. Free memory was 153.1MB in the beginning and 141.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 18:30:54,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.48ms. Allocated memory is still 186.6MB. Free memory was 141.4MB in the beginning and 139.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:30:54,893 INFO L158 Benchmark]: Boogie Preprocessor took 22.44ms. Allocated memory is still 186.6MB. Free memory was 139.4MB in the beginning and 137.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 18:30:54,895 INFO L158 Benchmark]: RCFGBuilder took 419.77ms. Allocated memory is still 186.6MB. Free memory was 137.9MB in the beginning and 115.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 18:30:54,897 INFO L158 Benchmark]: TraceAbstraction took 137899.93ms. Allocated memory was 186.6MB in the beginning and 720.4MB in the end (delta: 533.7MB). Free memory was 114.9MB in the beginning and 337.6MB in the end (delta: -222.7MB). Peak memory consumption was 400.1MB. Max. memory is 8.0GB. [2023-11-17 18:30:54,898 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 186.6MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.32ms. Allocated memory is still 186.6MB. Free memory was 153.1MB in the beginning and 141.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.48ms. Allocated memory is still 186.6MB. Free memory was 141.4MB in the beginning and 139.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.44ms. Allocated memory is still 186.6MB. Free memory was 139.4MB in the beginning and 137.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 419.77ms. Allocated memory is still 186.6MB. Free memory was 137.9MB in the beginning and 115.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 137899.93ms. Allocated memory was 186.6MB in the beginning and 720.4MB in the end (delta: 533.7MB). Free memory was 114.9MB in the beginning and 337.6MB in the end (delta: -222.7MB). Peak memory consumption was 400.1MB. 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 18:30:54,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...