/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 00:31:29,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 00:31:29,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 00:31:29,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 00:31:29,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 00:31:29,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 00:31:29,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 00:31:29,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 00:31:29,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 00:31:29,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 00:31:29,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 00:31:29,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 00:31:29,191 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 00:31:29,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 00:31:29,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 00:31:29,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 00:31:29,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 00:31:29,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 00:31:29,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 00:31:29,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 00:31:29,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 00:31:29,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 00:31:29,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 00:31:29,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 00:31:29,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 00:31:29,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 00:31:29,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 00:31:29,195 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 00:31:29,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 00:31:29,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 00:31:29,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 00:31:29,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 00:31:29,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 00:31:29,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 00:31:29,196 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 00:31:29,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 00:31:29,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 00:31:29,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 00:31:29,197 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 00:31:29,197 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-05 00:31:29,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 00:31:29,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 00:31:29,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 00:31:29,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 00:31:29,460 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 00:31:29,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-04-05 00:31:30,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 00:31:30,662 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 00:31:30,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-04-05 00:31:30,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/093c70f73/86f76447488f4b7ebc9b8fe98f60db79/FLAG2c3be55f8 [2024-04-05 00:31:30,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/093c70f73/86f76447488f4b7ebc9b8fe98f60db79 [2024-04-05 00:31:30,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 00:31:30,681 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 00:31:30,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 00:31:30,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 00:31:30,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 00:31:30,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb35a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30, skipping insertion in model container [2024-04-05 00:31:30,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,715 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 00:31:30,836 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/unroll-cond-5.wvr.c[2975,2988] [2024-04-05 00:31:30,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 00:31:30,850 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 00:31:30,871 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/unroll-cond-5.wvr.c[2975,2988] [2024-04-05 00:31:30,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 00:31:30,888 INFO L206 MainTranslator]: Completed translation [2024-04-05 00:31:30,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30 WrapperNode [2024-04-05 00:31:30,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 00:31:30,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 00:31:30,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 00:31:30,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 00:31:30,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,927 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 207 [2024-04-05 00:31:30,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 00:31:30,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 00:31:30,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 00:31:30,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 00:31:30,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 00:31:30,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 00:31:30,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 00:31:30,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 00:31:30,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (1/1) ... [2024-04-05 00:31:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 00:31:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:31:30,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 00:31:31,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 00:31:31,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 00:31:31,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 00:31:31,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 00:31:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 00:31:31,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 00:31:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 00:31:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 00:31:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 00:31:31,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 00:31:31,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 00:31:31,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 00:31:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 00:31:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 00:31:31,050 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 00:31:31,151 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 00:31:31,152 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 00:31:31,473 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 00:31:31,484 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 00:31:31,484 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-05 00:31:31,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:31:31 BoogieIcfgContainer [2024-04-05 00:31:31,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 00:31:31,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 00:31:31,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 00:31:31,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 00:31:31,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 12:31:30" (1/3) ... [2024-04-05 00:31:31,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5429e774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:31:31, skipping insertion in model container [2024-04-05 00:31:31,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:31:30" (2/3) ... [2024-04-05 00:31:31,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5429e774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:31:31, skipping insertion in model container [2024-04-05 00:31:31,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:31:31" (3/3) ... [2024-04-05 00:31:31,492 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2024-04-05 00:31:31,498 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 00:31:31,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 00:31:31,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 00:31:31,506 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 00:31:31,601 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 00:31:31,636 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 00:31:31,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 00:31:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:31:31,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 00:31:31,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 00:31:31,669 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 00:31:31,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:31:31,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 00:31:31,686 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;@65727b1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 00:31:31,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 00:31:31,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:31:31,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:31:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash 344194686, now seen corresponding path program 1 times [2024-04-05 00:31:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:31:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971777676] [2024-04-05 00:31:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:31:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 00:31:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:31:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971777676] [2024-04-05 00:31:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971777676] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:31:32,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 00:31:32,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 00:31:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272847914] [2024-04-05 00:31:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:31:32,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 00:31:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:31:32,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 00:31:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 00:31:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:32,264 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:31:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 00:31:32,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 00:31:32,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:31:32,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:31:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 675128059, now seen corresponding path program 1 times [2024-04-05 00:31:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:31:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309608530] [2024-04-05 00:31:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:31:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:31:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:31:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309608530] [2024-04-05 00:31:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309608530] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:31:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321201091] [2024-04-05 00:31:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:31:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:31:33,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:31:33,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 00:31:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:33,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2024-04-05 00:31:33,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:31:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:31:33,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 00:31:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321201091] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:31:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 00:31:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-04-05 00:31:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542108299] [2024-04-05 00:31:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:31:33,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 00:31:33,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:31:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 00:31:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-04-05 00:31:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:33,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:31:33,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 00:31:33,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:33,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:31:33,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 00:31:34,067 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,SelfDestructingSolverStorable1 [2024-04-05 00:31:34,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:31:34,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:31:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2135135284, now seen corresponding path program 1 times [2024-04-05 00:31:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:31:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936639644] [2024-04-05 00:31:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:31:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 00:31:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:31:34,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936639644] [2024-04-05 00:31:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936639644] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:31:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343779408] [2024-04-05 00:31:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:34,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:31:34,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:31:34,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:31:34,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 00:31:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:34,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 55 conjunts are in the unsatisfiable core [2024-04-05 00:31:34,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:31:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:31:36,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:31:37,071 INFO L349 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2024-04-05 00:31:37,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 143 [2024-04-05 00:31:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:31:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343779408] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:31:38,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:31:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 30, 28] total 60 [2024-04-05 00:31:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725592984] [2024-04-05 00:31:38,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:31:38,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-04-05 00:31:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:31:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-04-05 00:31:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2024-04-05 00:31:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:38,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:31:38,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 7.7) internal successors, (462), 60 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 00:31:38,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:38,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:31:38,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:31:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 00:31:41,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-05 00:31:41,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:31:41,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:31:41,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:31:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1760984451, now seen corresponding path program 1 times [2024-04-05 00:31:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:31:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336648121] [2024-04-05 00:31:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:31:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:31:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:31:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336648121] [2024-04-05 00:31:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336648121] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:31:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460586312] [2024-04-05 00:31:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:31:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:31:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:31:42,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:31:42,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 00:31:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:31:42,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-05 00:31:42,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:31:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:31:43,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:31:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:31:45,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460586312] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:31:45,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:31:45,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 63 [2024-04-05 00:31:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251436736] [2024-04-05 00:31:45,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:31:45,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-04-05 00:31:45,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:31:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-04-05 00:31:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3607, Unknown=0, NotChecked=0, Total=3906 [2024-04-05 00:31:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:45,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:31:45,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 8.253968253968255) internal successors, (520), 63 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 00:31:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:31:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:31:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 00:31:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:33:05,674 WARN L293 SmtUtils]: Spent 10.68s on a formula simplification. DAG size of input: 78 DAG size of output: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 00:33:34,041 WARN L293 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 72 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 00:33:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:33:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:33:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 00:33:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2024-04-05 00:33:50,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 00:33:50,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:33:50,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:33:50,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:33:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 795120285, now seen corresponding path program 2 times [2024-04-05 00:33:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:33:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509380494] [2024-04-05 00:33:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:33:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:33:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:33:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:33:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:33:52,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509380494] [2024-04-05 00:33:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509380494] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:33:52,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716337633] [2024-04-05 00:33:52,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 00:33:52,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:33:52,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:33:52,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:33:52,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-05 00:33:53,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 00:33:53,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 00:33:53,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 94 conjunts are in the unsatisfiable core [2024-04-05 00:33:53,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:33:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:33:55,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:34:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:34:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716337633] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:34:00,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:34:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 49, 49] total 131 [2024-04-05 00:34:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499890125] [2024-04-05 00:34:00,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:34:00,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2024-04-05 00:34:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:34:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2024-04-05 00:34:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=16093, Unknown=0, NotChecked=0, Total=17030 [2024-04-05 00:34:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:34:00,505 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:34:00,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 7.2748091603053435) internal successors, (953), 131 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 00:34:00,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:34:00,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:34:00,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 00:34:00,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 191 states. [2024-04-05 00:34:00,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:34:15,577 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296) 1)) (.cse4 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) 1))) (and (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 3) 4294967296) .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 4) 4294967296) .cse1) (< .cse2 .cse0) (< .cse3 .cse1) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296) 1)) (< .cse2 .cse5) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 1) 4294967296) .cse6) (< .cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296) 1)) (< .cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (< .cse7 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 2) 4294967296) .cse5) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< .cse3 19) (< (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296) .cse6) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (< .cse4 .cse0) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse4 .cse1) (< .cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) 1)) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296) 1)) (< .cse7 .cse5))) is different from false [2024-04-05 00:35:44,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:36:14,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:36:16,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:36:50,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse3 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 4) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 14) 4294967296) 1)) (< .cse3 (mod c_~n~0 4294967296)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post12#1| 9) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296) 19) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)))) is different from false [2024-04-05 00:39:41,684 WARN L293 SmtUtils]: Spent 8.91s on a formula simplification. DAG size of input: 129 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 00:39:46,198 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296) 1)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) 1))) (and (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 3) 4294967296) .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 4) 4294967296) .cse1) (< .cse2 .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296) .cse1) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296) 1)) (< .cse2 .cse4) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 1) 4294967296) .cse5) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296) 1)) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (< .cse6 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 2) 4294967296) .cse4) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296) .cse5) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (< .cse3 .cse0) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse3 .cse1) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296) 1)) (< .cse6 .cse4))) is different from false [2024-04-05 00:39:52,603 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse3 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 13) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296) (mod c_~n~0 4294967296)) (< .cse3 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 8) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296) 19) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (< .cse2 .cse1) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_#t~post4#1| 18) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)))) is different from false [2024-04-05 00:41:11,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4294967296 (div c_~n~0 4294967296))) (.cse3 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296) 1)) (.cse4 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) 1))) (and (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 3) 4294967296) .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 4) 4294967296) .cse1) (< .cse2 .cse0) (< .cse3 .cse1) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296) 1)) (< .cse2 .cse5) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 1) 4294967296) .cse6) (< .cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296) 1)) (< .cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (let ((.cse11 (* (div (+ 4294967292 c_~n~0) 4294967296) 4294967296)) (.cse9 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)))) (or (let ((.cse8 (+ |c_thread1Thread1of1ForFork1_#t~post2#1| .cse11))) (and (<= .cse8 (+ (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 5)) 4294967296) 4294967296) c_~n~0 4294967284)) (<= (+ .cse9 .cse10 4294967296) .cse8))) (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| .cse11) (+ .cse9 c_~n~0 12)))) (< .cse7 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< (+ .cse10 |c_thread1Thread1of1ForFork1_~i~0#1| 10) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0)) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 2) 4294967296) .cse5) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< .cse3 19) (< (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296) .cse6) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (< .cse4 .cse0) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse4 .cse1) (< .cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) 1)) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296) 1)) (< .cse7 .cse5))) is different from false [2024-04-05 00:41:56,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:41:58,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:00,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:04,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:05,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:08,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:11,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* (div (+ 4294967292 c_~n~0) 4294967296) 4294967296)) (.cse5 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)))) (let ((.cse8 (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| .cse7) (+ .cse5 c_~n~0 12))) (.cse6 (* 4294967296 (div c_~n~0 4294967296))) (.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296) 1)) (.cse9 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse3 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) 1))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296) .cse1) (< .cse0 .cse2) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (or (let ((.cse4 (+ |c_thread1Thread1of1ForFork1_#t~post2#1| .cse7))) (and (<= .cse4 (+ (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 5)) 4294967296) 4294967296) c_~n~0 4294967284)) (<= (+ .cse5 .cse6 4294967296) .cse4))) .cse8) (< .cse3 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (< .cse9 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (or .cse8 (< (+ .cse6 |c_thread1Thread1of1ForFork1_~i~0#1| 10) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0))) (< .cse9 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse9 .cse1) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) 1)) (< .cse9 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)) (< .cse3 .cse2)))) is different from false [2024-04-05 00:42:13,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:15,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:19,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:21,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:24,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:26,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:32,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:34,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:36,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:38,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:42:41,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 00:44:05,053 WARN L293 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 158 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 00:45:15,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse6 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296) 1)) (.cse4 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse8 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) 1))) (and (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 3) 4294967296) .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 4) 4294967296) .cse1) (< .cse2 .cse0) (< .cse3 .cse1) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296) 1)) (< .cse2 .cse5) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 1)) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 1) 4294967296) .cse7) (< .cse8 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296) 1)) (< .cse8 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (< .cse8 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1| 10) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0)) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 2) 4294967296) .cse5) (< .cse8 .cse7) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< .cse3 19) (< .cse6 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1)) (< .cse6 .cse7) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (< .cse4 .cse0) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (= (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) |c_thread2Thread1of1ForFork0_~i~1#1|) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse4 .cse1) (< .cse8 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) 1)) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296) 1)) (< .cse8 .cse5))) is different from false [2024-04-05 00:45:18,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (* 4294967296 (div c_~n~0 4294967296))) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3) 4294967296) 1)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 13) 4294967296) 1)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 18) 4294967296) 1)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) 1))) (and (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 3) 4294967296) .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 4) 4294967296) .cse1) (< .cse2 .cse0) (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296) .cse1) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 15) 4294967296) 1)) (< .cse2 .cse4) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 1) 4294967296) .cse5) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5) 4294967296) 1)) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296) 1)) (let ((.cse10 (* (div (+ 4294967292 c_~n~0) 4294967296) 4294967296)) (.cse8 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)))) (or (let ((.cse7 (+ |c_thread1Thread1of1ForFork1_#t~post2#1| .cse10))) (and (<= .cse7 (+ (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 5)) 4294967296) 4294967296) c_~n~0 4294967284)) (<= (+ .cse8 .cse9 4294967296) .cse7))) (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| .cse10) (+ .cse8 c_~n~0 12)))) (< .cse6 (+ (mod (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296) 1)) (< (+ .cse9 |c_thread1Thread1of1ForFork1_~i~0#1| 10) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0)) (< (mod (+ |c_thread1Thread1of1ForFork1_#t~post2#1| 2) 4294967296) .cse4) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296) .cse5) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 17) 4294967296) 1)) (< .cse3 .cse0) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 11) 4294967296) 1)) (< .cse3 .cse1) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 16) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296) 1)) (< .cse6 .cse4))) is different from false Received shutdown request... [2024-04-05 00:45:59,665 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 00:45:59,665 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 00:45:59,665 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 00:46:00,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-04-05 00:46:00,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 00:46:00,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 00:46:00,758 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-04-05 00:46:00,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 00:46:00,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 00:46:00,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 00:46:00,763 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-04-05 00:46:00,765 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 00:46:00,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 00:46:00,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:46:00 BasicIcfg [2024-04-05 00:46:00,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 00:46:00,767 INFO L158 Benchmark]: Toolchain (without parser) took 870086.02ms. Allocated memory was 264.2MB in the beginning and 563.1MB in the end (delta: 298.8MB). Free memory was 195.7MB in the beginning and 191.7MB in the end (delta: 4.0MB). Peak memory consumption was 303.0MB. Max. memory is 8.0GB. [2024-04-05 00:46:00,767 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 264.2MB. Free memory is still 233.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 00:46:00,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.93ms. Allocated memory is still 264.2MB. Free memory was 195.4MB in the beginning and 183.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-05 00:46:00,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.54ms. Allocated memory is still 264.2MB. Free memory was 183.1MB in the beginning and 180.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 00:46:00,768 INFO L158 Benchmark]: Boogie Preprocessor took 23.94ms. Allocated memory is still 264.2MB. Free memory was 180.9MB in the beginning and 178.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 00:46:00,768 INFO L158 Benchmark]: RCFGBuilder took 532.39ms. Allocated memory is still 264.2MB. Free memory was 178.9MB in the beginning and 229.2MB in the end (delta: -50.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-04-05 00:46:00,768 INFO L158 Benchmark]: TraceAbstraction took 869279.68ms. Allocated memory was 264.2MB in the beginning and 563.1MB in the end (delta: 298.8MB). Free memory was 227.6MB in the beginning and 191.7MB in the end (delta: 35.9MB). Peak memory consumption was 335.8MB. Max. memory is 8.0GB. [2024-04-05 00:46:00,769 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.10ms. Allocated memory is still 264.2MB. Free memory is still 233.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.93ms. Allocated memory is still 264.2MB. Free memory was 195.4MB in the beginning and 183.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.54ms. Allocated memory is still 264.2MB. Free memory was 183.1MB in the beginning and 180.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.94ms. Allocated memory is still 264.2MB. Free memory was 180.9MB in the beginning and 178.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 532.39ms. Allocated memory is still 264.2MB. Free memory was 178.9MB in the beginning and 229.2MB in the end (delta: -50.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 869279.68ms. Allocated memory was 264.2MB in the beginning and 563.1MB in the end (delta: 298.8MB). Free memory was 227.6MB in the beginning and 191.7MB in the end (delta: 35.9MB). Peak memory consumption was 335.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18522, independent: 14713, independent conditional: 14711, independent unconditional: 2, dependent: 3809, dependent conditional: 3795, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 14711, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 14711, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 14711, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 1783, independent unconditional: 12930, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 1615, independent unconditional: 13098, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 1615, independent unconditional: 13098, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2489, independent: 2489, independent conditional: 343, independent unconditional: 2146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2489, independent: 2489, independent conditional: 0, independent unconditional: 2489, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14713, independent: 12224, independent conditional: 1272, independent unconditional: 10952, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2489, unknown conditional: 343, unknown unconditional: 2146] , Statistics on independence cache: Total cache size (in pairs): 2489, Positive cache size: 2489, Positive conditional cache size: 343, Positive unconditional cache size: 2146, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 168, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 1783, independent unconditional: 12930, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 1615, independent unconditional: 13098, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14713, independent: 14713, independent conditional: 1615, independent unconditional: 13098, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2489, independent: 2489, independent conditional: 343, independent unconditional: 2146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2489, independent: 2489, independent conditional: 0, independent unconditional: 2489, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14713, independent: 12224, independent conditional: 1272, independent unconditional: 10952, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2489, unknown conditional: 343, unknown unconditional: 2146] , Statistics on independence cache: Total cache size (in pairs): 2489, Positive cache size: 2489, Positive conditional cache size: 343, Positive unconditional cache size: 2146, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 168 ], Independence queries for same thread: 3809 - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 392 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 869.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 848.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 557, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2853 ConstructedInterpolants, 0 QuantifiedInterpolants, 27092 SizeOfPredicates, 107 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 63/921 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2024-04-05 00:46:00,784 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 0