/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 03:59:23,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 03:59:23,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 03:59:23,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 03:59:23,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 03:59:23,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 03:59:23,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 03:59:23,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 03:59:23,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 03:59:23,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 03:59:23,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 03:59:23,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 03:59:23,435 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 03:59:23,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 03:59:23,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 03:59:23,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 03:59:23,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 03:59:23,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 03:59:23,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 03:59:23,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 03:59:23,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 03:59:23,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 03:59:23,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 03:59:23,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 03:59:23,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 03:59:23,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 03:59:23,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 03:59:23,439 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 03:59:23,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 03:59:23,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 03:59:23,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 03:59:23,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 03:59:23,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 03:59:23,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 03:59:23,442 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 03:59:23,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 03:59:23,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 03:59:23,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 03:59:23,442 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 03:59:23,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-05-06 03:59:23,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 03:59:23,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 03:59:23,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 03:59:23,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 03:59:23,745 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 03:59:23,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2024-05-06 03:59:24,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 03:59:25,106 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 03:59:25,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2024-05-06 03:59:25,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fba2afcd1/f2bd9abd8fef45c08979757e434df9f0/FLAG97cdf2fa8 [2024-05-06 03:59:25,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fba2afcd1/f2bd9abd8fef45c08979757e434df9f0 [2024-05-06 03:59:25,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 03:59:25,140 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 03:59:25,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 03:59:25,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 03:59:25,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 03:59:25,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d847429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25, skipping insertion in model container [2024-05-06 03:59:25,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,176 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 03:59:25,364 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-array-sum2.wvr.c[2599,2612] [2024-05-06 03:59:25,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 03:59:25,381 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 03:59:25,399 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-array-sum2.wvr.c[2599,2612] [2024-05-06 03:59:25,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 03:59:25,409 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 03:59:25,410 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 03:59:25,416 INFO L206 MainTranslator]: Completed translation [2024-05-06 03:59:25,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25 WrapperNode [2024-05-06 03:59:25,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 03:59:25,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 03:59:25,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 03:59:25,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 03:59:25,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,464 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 279 [2024-05-06 03:59:25,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 03:59:25,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 03:59:25,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 03:59:25,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 03:59:25,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 03:59:25,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 03:59:25,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 03:59:25,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 03:59:25,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (1/1) ... [2024-05-06 03:59:25,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 03:59:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:59:25,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 03:59:25,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 03:59:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 03:59:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 03:59:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 03:59:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 03:59:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 03:59:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 03:59:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 03:59:25,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 03:59:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 03:59:25,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 03:59:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 03:59:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 03:59:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 03:59:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-06 03:59:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 03:59:25,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 03:59:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 03:59:25,580 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 03:59:25,666 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 03:59:25,668 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 03:59:26,146 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 03:59:26,391 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 03:59:26,391 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2024-05-06 03:59:26,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:59:26 BoogieIcfgContainer [2024-05-06 03:59:26,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 03:59:26,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 03:59:26,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 03:59:26,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 03:59:26,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 03:59:25" (1/3) ... [2024-05-06 03:59:26,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c1a25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:59:26, skipping insertion in model container [2024-05-06 03:59:26,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:59:25" (2/3) ... [2024-05-06 03:59:26,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c1a25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:59:26, skipping insertion in model container [2024-05-06 03:59:26,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:59:26" (3/3) ... [2024-05-06 03:59:26,404 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2024-05-06 03:59:26,411 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 03:59:26,421 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 03:59:26,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 03:59:26,421 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 03:59:26,486 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-06 03:59:26,537 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 03:59:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 03:59:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:59:26,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 03:59:26,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 03:59:26,592 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 03:59:26,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:59:26,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 03:59:26,613 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;@d5d1486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 03:59:26,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 03:59:27,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 03:59:27,478 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 274 treesize of output 142 [2024-05-06 03:59:40,538 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 03:59:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1704856143, now seen corresponding path program 1 times [2024-05-06 03:59:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:59:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:59:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:59:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 03:59:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:59:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:59:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:59:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 03:59:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 03:59:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 03:59:41,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 03:59:41,449 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 274 treesize of output 142 [2024-05-06 04:00:03,879 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:00:05,887 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_In_2| Int) (v_~A~0.offset_In_2 Int) (|v_thread2Thread1of1ForFork1_~i~1#1_In_2| Int) (v_~A~0.base_In_2 Int) (v_~B~0.base_In_2 Int)) (let ((.cse5 (select |c_#memory_int| v_~A~0.base_In_2)) (.cse7 (select |c_#memory_int| v_~B~0.base_In_2)) (.cse8 (* |v_thread3Thread1of1ForFork2_~i~2#1_In_2| 4))) (let ((.cse6 (* |v_thread2Thread1of1ForFork1_~i~1#1_In_2| 4)) (.cse3 (select .cse7 (+ .cse8 c_~B~0.offset))) (.cse4 (select .cse5 (+ v_~A~0.offset_In_2 .cse8)))) (let ((.cse0 (+ .cse3 .cse4)) (.cse1 (select .cse7 (+ .cse6 c_~B~0.offset))) (.cse2 (select .cse5 (+ .cse6 v_~A~0.offset_In_2)))) (or (< 2147483647 .cse0) (< (+ .cse1 .cse2 2147483648) 0) (< (+ .cse3 .cse4 2147483648) 0) (= .cse0 0) (< 2147483647 (+ .cse1 .cse2))))))) (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_In_2| Int) (v_~A~0.offset_In_2 Int) (|v_thread2Thread1of1ForFork1_~i~1#1_In_2| Int) (v_~A~0.base_In_2 Int) (v_~B~0.base_In_2 Int)) (let ((.cse14 (* |v_thread2Thread1of1ForFork1_~i~1#1_In_2| 4)) (.cse13 (select |c_#memory_int| v_~A~0.base_In_2)) (.cse15 (select |c_#memory_int| v_~B~0.base_In_2)) (.cse16 (* |v_thread3Thread1of1ForFork2_~i~2#1_In_2| 4))) (let ((.cse9 (select .cse15 (+ .cse16 c_~B~0.offset))) (.cse10 (select .cse13 (+ v_~A~0.offset_In_2 .cse16))) (.cse11 (select .cse15 (+ .cse14 c_~B~0.offset))) (.cse12 (select .cse13 (+ .cse14 v_~A~0.offset_In_2)))) (or (< 2147483647 (+ .cse9 .cse10)) (< (+ .cse11 .cse12 2147483648) 0) (< (+ .cse9 .cse10 2147483648) 0) (= (+ .cse11 .cse9 .cse12 .cse10) 0) (< 2147483647 (+ .cse11 .cse12))))))) is different from false [2024-05-06 04:00:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2138052116, now seen corresponding path program 1 times [2024-05-06 04:00:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 04:00:06,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 04:00:06,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 04:00:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2024-05-06 04:00:07,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:00:07,067 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 256 treesize of output 140 [2024-05-06 04:00:16,652 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:00:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 45061923, now seen corresponding path program 1 times [2024-05-06 04:00:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:00:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:00:19,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:00:19,689 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 256 treesize of output 140 [2024-05-06 04:00:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2076756398, now seen corresponding path program 2 times [2024-05-06 04:00:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:00:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:00:32,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:00:32,603 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 256 treesize of output 140 [2024-05-06 04:00:42,543 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:00:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1542319013, now seen corresponding path program 1 times [2024-05-06 04:00:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:00:52,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:00:52,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:00:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:00:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:00:53,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:00:53,356 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 274 treesize of output 142 [2024-05-06 04:01:02,462 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:01:04,467 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~B~0.base_In_6 Int) (|v_thread2Thread1of1ForFork1_~i~1#1_In_6| Int) (v_~A~0.base_In_6 Int) (|v_thread3Thread1of1ForFork2_~i~2#1_In_6| Int) (v_~A~0.offset_In_6 Int)) (let ((.cse5 (select |c_#memory_int| v_~A~0.base_In_6)) (.cse7 (select |c_#memory_int| v_~B~0.base_In_6)) (.cse8 (* |v_thread2Thread1of1ForFork1_~i~1#1_In_6| 4))) (let ((.cse0 (select .cse7 (+ .cse8 c_~B~0.offset))) (.cse1 (select .cse5 (+ v_~A~0.offset_In_6 .cse8))) (.cse6 (* |v_thread3Thread1of1ForFork2_~i~2#1_In_6| 4))) (let ((.cse2 (select .cse7 (+ .cse6 c_~B~0.offset))) (.cse3 (select .cse5 (+ v_~A~0.offset_In_6 .cse6))) (.cse4 (+ .cse0 .cse1))) (or (< (+ .cse0 .cse1 2147483648) 0) (< (+ .cse2 .cse3 2147483648) 0) (< 2147483647 (+ .cse2 .cse3)) (= .cse4 0) (< 2147483647 .cse4)))))) is different from false [2024-05-06 04:01:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash -759728827, now seen corresponding path program 3 times [2024-05-06 04:01:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:01:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:01:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:01:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:01:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:01:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:01:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:01:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:01:05,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:01:05,054 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 256 treesize of output 140 [2024-05-06 04:01:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -154947320, now seen corresponding path program 2 times [2024-05-06 04:01:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:01:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:01:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:01:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:01:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:01:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:01:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:01:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:01:20,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:01:20,716 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 274 treesize of output 142 [2024-05-06 04:01:44,973 WARN L293 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:01:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -24507404, now seen corresponding path program 4 times [2024-05-06 04:01:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:01:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:01:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:01:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:01:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:01:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:01:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:01:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:01:57,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:01:57,769 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 256 treesize of output 140 [2024-05-06 04:02:07,789 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:02:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash 392758905, now seen corresponding path program 3 times [2024-05-06 04:02:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:02:25,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:02:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:02:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:02:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:02:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:02:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:02:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:02:26,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:02:26,513 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 256 treesize of output 140 [2024-05-06 04:02:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 969040743, now seen corresponding path program 5 times [2024-05-06 04:02:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:02:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:02:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:02:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:02:59,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:02:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:02:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:02:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:02:59,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:02:59,668 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 274 treesize of output 142 [2024-05-06 04:03:24,209 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:03:26,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse8 (+ c_~A~0.offset .cse6))) (and (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_In_11| Int) (v_~B~0.offset_In_11 Int) (v_~A~0.base_In_11 Int) (v_~B~0.base_In_11 Int)) (let ((.cse5 (select |c_#memory_int| v_~B~0.base_In_11)) (.cse7 (select |c_#memory_int| v_~A~0.base_In_11)) (.cse9 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_In_11|))) (let ((.cse3 (select .cse7 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse5 (+ .cse9 v_~B~0.offset_In_11)))) (let ((.cse0 (select .cse7 .cse8)) (.cse1 (select .cse5 (+ .cse6 v_~B~0.offset_In_11))) (.cse2 (+ .cse3 .cse4))) (or (< (+ .cse0 .cse1 2147483648) 0) (< 2147483647 .cse2) (< 2147483647 (+ .cse0 .cse1)) (= .cse2 0) (< (+ .cse3 2147483648 .cse4) 0)))))) (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_In_11| Int) (v_~B~0.offset_In_11 Int) (v_~A~0.base_In_11 Int) (v_~B~0.base_In_11 Int)) (let ((.cse15 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_In_11|)) (.cse14 (select |c_#memory_int| v_~B~0.base_In_11)) (.cse16 (select |c_#memory_int| v_~A~0.base_In_11))) (let ((.cse10 (select .cse16 .cse8)) (.cse11 (select .cse14 (+ .cse6 v_~B~0.offset_In_11))) (.cse12 (select .cse16 (+ c_~A~0.offset .cse15))) (.cse13 (select .cse14 (+ .cse15 v_~B~0.offset_In_11)))) (or (< (+ .cse10 .cse11 2147483648) 0) (< 2147483647 (+ .cse12 .cse13)) (< 2147483647 (+ .cse10 .cse11)) (= 0 (+ .cse12 .cse10 .cse11 .cse13)) (< (+ .cse12 2147483648 .cse13) 0)))))))) is different from false [2024-05-06 04:03:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -333546842, now seen corresponding path program 4 times [2024-05-06 04:03:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:03:26,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:03:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:03:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:03:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:03:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:03:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:03:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:03:26,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:03:26,927 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 274 treesize of output 142 [2024-05-06 04:03:39,131 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:04:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1279502423, now seen corresponding path program 1 times [2024-05-06 04:04:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:04:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:04:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:04:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:04:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:04:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:04:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:04:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 04:04:06,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:04:06,487 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 274 treesize of output 142 [2024-05-06 04:04:25,016 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:04:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1343830564, now seen corresponding path program 1 times [2024-05-06 04:04:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:04:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:04:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:04:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:04:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:04:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:04:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:04:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 04:04:55,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 04:04:55,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:04:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2097813710, now seen corresponding path program 1 times [2024-05-06 04:04:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:04:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718141354] [2024-05-06 04:04:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:04:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:04:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:04:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-06 04:04:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:04:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718141354] [2024-05-06 04:04:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718141354] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:04:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457867052] [2024-05-06 04:04:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:04:55,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:04:55,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:04:55,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 04:04:55,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 04:04:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:04:56,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-06 04:04:56,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:04:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-06 04:04:56,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 04:04:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-06 04:04:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457867052] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 04:04:56,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 04:04:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-05-06 04:04:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098296339] [2024-05-06 04:04:56,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 04:04:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-06 04:04:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:04:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-06 04:04:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-05-06 04:04:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:04:56,656 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:04:56,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.12) internal successors, (253), 25 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 04:04:56,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:04:57,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:04:57,470 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 274 treesize of output 142 [2024-05-06 04:05:18,158 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 39 DAG size of output: 35 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:06:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash -294404262, now seen corresponding path program 6 times [2024-05-06 04:06:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:06:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:06:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:06:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:06:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:06:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:06:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:06:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:06:02,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:06:02,201 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 274 treesize of output 142 [2024-05-06 04:06:14,299 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:06:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1237429051, now seen corresponding path program 7 times [2024-05-06 04:06:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:06:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:06:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:06:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:06:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:06:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:06:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:06:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:06:45,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:06:45,108 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 274 treesize of output 142 [2024-05-06 04:06:56,403 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 39 DAG size of output: 35 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:07:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1066668114, now seen corresponding path program 5 times [2024-05-06 04:07:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:07:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:07:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:07:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:07:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:07:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:07:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:07:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:07:37,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:07:37,677 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 274 treesize of output 142 [2024-05-06 04:07:48,796 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:08:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1761198276, now seen corresponding path program 8 times [2024-05-06 04:08:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:08:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:08:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:08:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:08:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:08:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:08:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:08:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:08:17,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:08:17,928 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 274 treesize of output 142 [2024-05-06 04:08:38,110 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:09:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2007423537, now seen corresponding path program 6 times [2024-05-06 04:09:30,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:09:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:09:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:09:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-06 04:09:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:09:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:09:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:09:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-06 04:09:31,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:09:31,170 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 256 treesize of output 140 [2024-05-06 04:09:44,764 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:10:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1026644195, now seen corresponding path program 9 times [2024-05-06 04:10:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:10:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:10:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:10:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:10:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:10:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:10:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:10:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-06 04:10:48,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:10:48,506 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 274 treesize of output 142 [2024-05-06 04:11:06,838 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:12:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 878154800, now seen corresponding path program 7 times [2024-05-06 04:12:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:12:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:12:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:12:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-06 04:12:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:12:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:12:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:12:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-06 04:12:12,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 04:12:12,586 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 274 treesize of output 142 [2024-05-06 04:12:32,466 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 210] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.abduction.Abducer.solveAbductionProblem) [2024-05-06 04:13:16,322 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-06 04:13:16,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-05-06 04:13:16,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 04:13:16,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39 [2024-05-06 04:13:16,524 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/UGemCutter-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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:161) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:189) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:321) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) 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) ... 40 more [2024-05-06 04:13:16,527 INFO L158 Benchmark]: Toolchain (without parser) took 831387.45ms. Allocated memory was 304.1MB in the beginning and 482.3MB in the end (delta: 178.3MB). Free memory was 234.7MB in the beginning and 131.3MB in the end (delta: 103.4MB). Peak memory consumption was 284.4MB. Max. memory is 8.0GB. [2024-05-06 04:13:16,528 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 04:13:16,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.64ms. Allocated memory is still 304.1MB. Free memory was 234.5MB in the beginning and 222.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-06 04:13:16,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.08ms. Allocated memory is still 304.1MB. Free memory was 222.6MB in the beginning and 219.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 04:13:16,528 INFO L158 Benchmark]: Boogie Preprocessor took 37.07ms. Allocated memory is still 304.1MB. Free memory was 219.9MB in the beginning and 217.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 04:13:16,529 INFO L158 Benchmark]: RCFGBuilder took 890.87ms. Allocated memory is still 304.1MB. Free memory was 217.5MB in the beginning and 220.6MB in the end (delta: -3.1MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2024-05-06 04:13:16,529 INFO L158 Benchmark]: TraceAbstraction took 830130.64ms. Allocated memory was 304.1MB in the beginning and 482.3MB in the end (delta: 178.3MB). Free memory was 219.6MB in the beginning and 131.3MB in the end (delta: 88.3MB). Peak memory consumption was 267.9MB. Max. memory is 8.0GB. [2024-05-06 04:13:16,530 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 181.4MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.64ms. Allocated memory is still 304.1MB. Free memory was 234.5MB in the beginning and 222.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.08ms. Allocated memory is still 304.1MB. Free memory was 222.6MB in the beginning and 219.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.07ms. Allocated memory is still 304.1MB. Free memory was 219.9MB in the beginning and 217.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 890.87ms. Allocated memory is still 304.1MB. Free memory was 217.5MB in the beginning and 220.6MB in the end (delta: -3.1MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * TraceAbstraction took 830130.64ms. Allocated memory was 304.1MB in the beginning and 482.3MB in the end (delta: 178.3MB). Free memory was 219.6MB in the beginning and 131.3MB in the end (delta: 88.3MB). Peak memory consumption was 267.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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/UGemCutter-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. [2024-05-06 04:13:16,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...