/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 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 15:29:35,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 15:29:35,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 15:29:35,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 15:29:35,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 15:29:35,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 15:29:35,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 15:29:35,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 15:29:35,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 15:29:35,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 15:29:35,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 15:29:35,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 15:29:35,221 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 15:29:35,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 15:29:35,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 15:29:35,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 15:29:35,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 15:29:35,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 15:29:35,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 15:29:35,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 15:29:35,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 15:29:35,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 15:29:35,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 15:29:35,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 15:29:35,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 15:29:35,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 15:29:35,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 15:29:35,225 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 15:29:35,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 15:29:35,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 15:29:35,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 15:29:35,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 15:29:35,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 15:29:35,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 15:29:35,227 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 15:29:35,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 15:29:35,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 15:29:35,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 15:29:35,227 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 15:29:35,227 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-05 15:29:35,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 15:29:35,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 15:29:35,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 15:29:35,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 15:29:35,496 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 15:29:35,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-04-05 15:29:36,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 15:29:36,587 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 15:29:36,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-04-05 15:29:36,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/873d32361/4e7c22149f944c20a4b50ea7d93f5093/FLAGdbee15859 [2024-04-05 15:29:36,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/873d32361/4e7c22149f944c20a4b50ea7d93f5093 [2024-04-05 15:29:36,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 15:29:36,612 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 15:29:36,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 15:29:36,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 15:29:36,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 15:29:36,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696c84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36, skipping insertion in model container [2024-04-05 15:29:36,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,634 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 15:29:36,748 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-4.wvr.c[2808,2821] [2024-04-05 15:29:36,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 15:29:36,780 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 15:29:36,800 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-4.wvr.c[2808,2821] [2024-04-05 15:29:36,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 15:29:36,816 INFO L206 MainTranslator]: Completed translation [2024-04-05 15:29:36,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36 WrapperNode [2024-04-05 15:29:36,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 15:29:36,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 15:29:36,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 15:29:36,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 15:29:36,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,847 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 186 [2024-04-05 15:29:36,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 15:29:36,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 15:29:36,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 15:29:36,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 15:29:36,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 15:29:36,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 15:29:36,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 15:29:36,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 15:29:36,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (1/1) ... [2024-04-05 15:29:36,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 15:29:36,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:29:36,899 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 15:29:36,924 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 15:29:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 15:29:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 15:29:36,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 15:29:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 15:29:36,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 15:29:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 15:29:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 15:29:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 15:29:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 15:29:36,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 15:29:36,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 15:29:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 15:29:36,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 15:29:36,961 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 15:29:37,057 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 15:29:37,059 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 15:29:37,292 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 15:29:37,306 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 15:29:37,306 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-05 15:29:37,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:29:37 BoogieIcfgContainer [2024-04-05 15:29:37,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 15:29:37,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 15:29:37,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 15:29:37,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 15:29:37,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 03:29:36" (1/3) ... [2024-04-05 15:29:37,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350b2f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:29:37, skipping insertion in model container [2024-04-05 15:29:37,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:29:36" (2/3) ... [2024-04-05 15:29:37,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350b2f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:29:37, skipping insertion in model container [2024-04-05 15:29:37,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:29:37" (3/3) ... [2024-04-05 15:29:37,314 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-04-05 15:29:37,320 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 15:29:37,327 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 15:29:37,327 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 15:29:37,327 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 15:29:37,422 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 15:29:37,459 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 15:29:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 15:29:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:29:37,460 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 15:29:37,461 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 15:29:37,495 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 15:29:37,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:29:37,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 15:29:37,524 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;@297f3f1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 15:29:37,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 15:29:38,241 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 15:29:38,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:29:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -124361033, now seen corresponding path program 1 times [2024-04-05 15:29:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:29:38,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64720921] [2024-04-05 15:29:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:38,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:29:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:38,522 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 15:29:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:29:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64720921] [2024-04-05 15:29:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64720921] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:29:38,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 15:29:38,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 15:29:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299290204] [2024-04-05 15:29:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:29:38,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 15:29:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:29:38,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 15:29:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 15:29:38,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:38,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:29:38,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 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 15:29:38,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:38,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 15:29:38,661 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 15:29:38,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:29:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2010415305, now seen corresponding path program 1 times [2024-04-05 15:29:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:29:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468070453] [2024-04-05 15:29:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:29:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:39,347 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 15:29:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:29:39,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468070453] [2024-04-05 15:29:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468070453] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:29:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990283717] [2024-04-05 15:29:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:39,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:29:39,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:29:39,390 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 15:29:39,419 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 15:29:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:39,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2024-04-05 15:29:39,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:29:39,694 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 15:29:39,694 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 15:29:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990283717] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:29:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 15:29:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-04-05 15:29:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758794993] [2024-04-05 15:29:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:29:39,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 15:29:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:29:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 15:29:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-04-05 15:29:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:39,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:29:39,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 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 15:29:39,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:39,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 15:29:39,947 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-04-05 15:29:40,144 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 15:29:40,145 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 15:29:40,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:29:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1699666781, now seen corresponding path program 1 times [2024-04-05 15:29:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:29:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204457253] [2024-04-05 15:29:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:29:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:40,543 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 15:29:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:29:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204457253] [2024-04-05 15:29:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204457253] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:29:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443495904] [2024-04-05 15:29:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:40,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:29:40,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:29:40,548 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 15:29:40,575 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 15:29:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:40,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjunts are in the unsatisfiable core [2024-04-05 15:29:40,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:29:41,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-04-05 15:29:41,471 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 15:29:41,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:29:41,938 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-04-05 15:29:41,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-04-05 15:29:42,608 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 15:29:42,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443495904] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:29:42,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:29:42,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2024-04-05 15:29:42,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416559243] [2024-04-05 15:29:42,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:29:42,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-04-05 15:29:42,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:29:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-04-05 15:29:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2024-04-05 15:29:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:42,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:29:42,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.439024390243903) internal successors, (387), 41 states have internal predecessors, (387), 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 15:29:42,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:42,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 15:29:42,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 15:29:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 15:29:44,520 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 15:29:44,712 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 15:29:44,713 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 15:29:44,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:29:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1110464735, now seen corresponding path program 1 times [2024-04-05 15:29:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:29:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121301452] [2024-04-05 15:29:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:29:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:45,728 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 15:29:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:29:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121301452] [2024-04-05 15:29:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121301452] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:29:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714966641] [2024-04-05 15:29:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:29:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:29:45,730 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 15:29:45,731 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 15:29:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:45,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2024-04-05 15:29:45,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:29:46,610 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 15:29:46,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:29:47,805 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 15:29:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714966641] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:29:47,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:29:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 36 [2024-04-05 15:29:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061294183] [2024-04-05 15:29:47,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:29:47,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-05 15:29:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:29:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-05 15:29:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2024-04-05 15:29:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:47,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:29:47,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.416666666666666) internal successors, (447), 36 states have internal predecessors, (447), 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 15:29:47,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 15:29:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 15:29:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:29:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 15:29:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-05 15:29:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-04-05 15:29:52,549 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 15:29:52,742 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 15:29:52,742 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 15:29:52,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:29:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1013286976, now seen corresponding path program 2 times [2024-04-05 15:29:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:29:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352004082] [2024-04-05 15:29:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:29:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:29:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:29:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 15:29:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:29:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352004082] [2024-04-05 15:29:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352004082] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:29:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874891071] [2024-04-05 15:29:55,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 15:29:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:29:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:29:55,271 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 15:29:55,273 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 15:29:55,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 15:29:55,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:29:55,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 94 conjunts are in the unsatisfiable core [2024-04-05 15:29:55,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:29:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 15:29:56,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:30:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 15:30:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874891071] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:30:00,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:30:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 101 [2024-04-05 15:30:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218146133] [2024-04-05 15:30:00,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:30:00,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-04-05 15:30:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:30:00,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-04-05 15:30:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=9303, Unknown=0, NotChecked=0, Total=10100 [2024-04-05 15:30:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:30:00,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:30:00,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 7.03960396039604) internal successors, (711), 101 states have internal predecessors, (711), 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 15:30:00,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:30:00,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 15:30:00,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-05 15:30:00,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-04-05 15:30:00,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:30:11,310 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse5 19) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse6) (< .cse2 .cse7) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse7) (< .cse3 .cse7) (< .cse3 .cse6) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< .cse5 .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6))) is different from false [2024-04-05 15:30:18,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:30:23,524 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 15:30:27,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:32:27,406 WARN L293 SmtUtils]: Spent 21.14s on a formula simplification. DAG size of input: 75 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:32:28,661 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 15:32:30,749 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 15:32:32,752 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 15:32:33,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:32:35,963 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 15:32:37,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:32:38,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:33:30,641 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 55 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:33:35,653 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 15:33:37,661 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 15:33:39,667 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 15:33:41,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:33:43,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:33:46,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:33:48,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:33:50,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:33:54,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 17) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 .cse3) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse2 .cse3) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 13) 4294967296) 1)) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)))) is different from false [2024-04-05 15:34:25,756 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 51 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:34:29,156 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 15:35:25,420 WARN L293 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 64 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:36:27,654 WARN L293 SmtUtils]: Spent 11.87s on a formula simplification. DAG size of input: 60 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:36:29,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:36:34,131 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse1 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296))) (and (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_#t~post10#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ 3 |c_thread2Thread1of1ForFork1_#t~post10#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ 11 |c_thread2Thread1of1ForFork1_#t~post10#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 .cse4) (< .cse0 .cse5) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (< .cse2 .cse5) (< .cse2 .cse4) (< .cse1 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ 15 |c_thread2Thread1of1ForFork1_#t~post10#1|) 4294967296) 1)))) is different from false [2024-04-05 15:37:36,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:40:35,293 WARN L293 SmtUtils]: Spent 25.69s on a formula simplification. DAG size of input: 90 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:40:37,296 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 15:40:39,668 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 15:40:42,165 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse3 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse1 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse1 .cse2) (< .cse3 .cse4) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse4) (< .cse0 .cse2) (< .cse3 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)))) is different from false [2024-04-05 15:41:13,244 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 15:41:44,367 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse5) (< .cse2 .cse6) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6) (< .cse3 .cse6) (< .cse3 .cse5) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse5))) is different from false [2024-04-05 15:41:50,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse3 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse2 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 18) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse4) (< .cse0 .cse5) (< .cse3 .cse6) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse6) (< .cse1 .cse5) (< .cse1 .cse4) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 6) 4294967296) 1)) (< .cse0 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 10) 4294967296) 1)))) is different from false [2024-04-05 15:42:28,095 WARN L293 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 51 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:42:30,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:42:32,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:42:33,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:42:34,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:42:36,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:42:40,213 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 15:42:43,816 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 15:42:45,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:42:48,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:43:17,573 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 55 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 15:43:19,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:43:21,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:43:24,866 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 15:43:27,559 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 15:43:29,563 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 15:43:33,182 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 15:43:37,615 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 15:43:40,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:43:47,410 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 15:43:49,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:43:54,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 15:44:02,203 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 15:44:05,492 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 [] Received shutdown request... [2024-04-05 15:44:05,520 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 15:44:05,536 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 15:44:05,536 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 15:44:06,547 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 [2024-04-05 15:44:06,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-04-05 15:44:06,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 15:44:06,580 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-04-05 15:44:06,581 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 15:44:06,582 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 15:44:06,582 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 15:44:06,585 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-04-05 15:44:06,587 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 15:44:06,587 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 15:44:06,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 03:44:06 BasicIcfg [2024-04-05 15:44:06,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 15:44:06,588 INFO L158 Benchmark]: Toolchain (without parser) took 869977.06ms. Allocated memory was 169.9MB in the beginning and 633.3MB in the end (delta: 463.5MB). Free memory was 99.3MB in the beginning and 293.1MB in the end (delta: -193.8MB). Peak memory consumption was 271.2MB. Max. memory is 8.0GB. [2024-04-05 15:44:06,589 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory was 144.4MB in the beginning and 144.3MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 15:44:06,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.62ms. Allocated memory was 169.9MB in the beginning and 260.0MB in the end (delta: 90.2MB). Free memory was 99.1MB in the beginning and 229.8MB in the end (delta: -130.7MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2024-04-05 15:44:06,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.82ms. Allocated memory is still 260.0MB. Free memory was 229.2MB in the beginning and 227.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 15:44:06,589 INFO L158 Benchmark]: Boogie Preprocessor took 20.65ms. Allocated memory is still 260.0MB. Free memory was 227.1MB in the beginning and 225.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 15:44:06,589 INFO L158 Benchmark]: RCFGBuilder took 438.83ms. Allocated memory is still 260.0MB. Free memory was 225.6MB in the beginning and 205.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-04-05 15:44:06,590 INFO L158 Benchmark]: TraceAbstraction took 869278.50ms. Allocated memory was 260.0MB in the beginning and 633.3MB in the end (delta: 373.3MB). Free memory was 204.1MB in the beginning and 293.1MB in the end (delta: -89.0MB). Peak memory consumption was 284.3MB. Max. memory is 8.0GB. [2024-04-05 15:44:06,596 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.09ms. Allocated memory is still 169.9MB. Free memory was 144.4MB in the beginning and 144.3MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.62ms. Allocated memory was 169.9MB in the beginning and 260.0MB in the end (delta: 90.2MB). Free memory was 99.1MB in the beginning and 229.8MB in the end (delta: -130.7MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.82ms. Allocated memory is still 260.0MB. Free memory was 229.2MB in the beginning and 227.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.65ms. Allocated memory is still 260.0MB. Free memory was 227.1MB in the beginning and 225.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 438.83ms. Allocated memory is still 260.0MB. Free memory was 225.6MB in the beginning and 205.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 869278.50ms. Allocated memory was 260.0MB in the beginning and 633.3MB in the end (delta: 373.3MB). Free memory was 204.1MB in the beginning and 293.1MB in the end (delta: -89.0MB). Peak memory consumption was 284.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30577, independent: 23626, independent conditional: 22283, independent unconditional: 1343, dependent: 6951, dependent conditional: 5627, dependent unconditional: 1324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23626, independent: 23626, independent conditional: 22283, independent unconditional: 1343, 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: 23626, independent: 23626, independent conditional: 22283, independent unconditional: 1343, 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: 23626, independent: 23626, independent conditional: 22283, independent unconditional: 1343, 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: 23626, independent: 23626, independent conditional: 1160, independent unconditional: 22466, 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: 23626, independent: 23626, independent conditional: 1154, independent unconditional: 22472, 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: 23626, independent: 23626, independent conditional: 1154, independent unconditional: 22472, 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: 1849, independent: 1849, independent conditional: 7, independent unconditional: 1842, 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: 1849, independent: 1849, independent conditional: 0, independent unconditional: 1849, 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: 23626, independent: 21777, independent conditional: 1147, independent unconditional: 20630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1849, unknown conditional: 7, unknown unconditional: 1842] , Statistics on independence cache: Total cache size (in pairs): 1849, Positive cache size: 1849, Positive conditional cache size: 7, Positive unconditional cache size: 1842, 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: 6, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23626, independent: 23626, independent conditional: 1160, independent unconditional: 22466, 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: 23626, independent: 23626, independent conditional: 1154, independent unconditional: 22472, 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: 23626, independent: 23626, independent conditional: 1154, independent unconditional: 22472, 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: 1849, independent: 1849, independent conditional: 7, independent unconditional: 1842, 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: 1849, independent: 1849, independent conditional: 0, independent unconditional: 1849, 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: 23626, independent: 21777, independent conditional: 1147, independent unconditional: 20630, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1849, unknown conditional: 7, unknown unconditional: 1842] , Statistics on independence cache: Total cache size (in pairs): 1849, Positive cache size: 1849, Positive conditional cache size: 7, Positive unconditional cache size: 1842, 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: 6 ], Independence queries for same thread: 6951 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: 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 [2024-04-05 15:44:06,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 CFG has 5 procedures, 338 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 869.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 853.6s, 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: 360, 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.7s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2699 ConstructedInterpolants, 34 QuantifiedInterpolants, 25233 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1623 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 63/1257 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