/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 2 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 08:00:35,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 08:00:35,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 08:00:35,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 08:00:35,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 08:00:35,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 08:00:35,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 08:00:35,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 08:00:35,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 08:00:35,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 08:00:35,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 08:00:35,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 08:00:35,139 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 08:00:35,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 08:00:35,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 08:00:35,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 08:00:35,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 08:00:35,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 08:00:35,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 08:00:35,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 08:00:35,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 08:00:35,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 08:00:35,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 08:00:35,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 08:00:35,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 08:00:35,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 08:00:35,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 08:00:35,149 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 08:00:35,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 08:00:35,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 08:00:35,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 08:00:35,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 08:00:35,152 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 08:00:35,152 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 -> 2 [2024-05-06 08:00:35,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 08:00:35,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 08:00:35,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 08:00:35,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 08:00:35,408 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 08:00:35,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-05-06 08:00:36,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 08:00:36,710 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 08:00:36,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-05-06 08:00:36,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f55e76a46/1650a88ff257431899115241135bb084/FLAGc4b7296f5 [2024-05-06 08:00:36,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f55e76a46/1650a88ff257431899115241135bb084 [2024-05-06 08:00:36,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 08:00:36,728 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 08:00:36,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 08:00:36,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 08:00:36,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 08:00:36,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:36,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623a1573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36, skipping insertion in model container [2024-05-06 08:00:36,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:36,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 08:00:36,902 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2612,2625] [2024-05-06 08:00:36,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 08:00:36,916 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 08:00:36,947 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2612,2625] [2024-05-06 08:00:36,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 08:00:36,953 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 08:00:36,953 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 08:00:36,959 INFO L206 MainTranslator]: Completed translation [2024-05-06 08:00:36,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36 WrapperNode [2024-05-06 08:00:36,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 08:00:36,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 08:00:36,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 08:00:36,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 08:00:36,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:36,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:36,998 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-05-06 08:00:36,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 08:00:36,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 08:00:36,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 08:00:36,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 08:00:37,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 08:00:37,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 08:00:37,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 08:00:37,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 08:00:37,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (1/1) ... [2024-05-06 08:00:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 08:00:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:00:37,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 08:00:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 08:00:37,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 08:00:37,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 08:00:37,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 08:00:37,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 08:00:37,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 08:00:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 08:00:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 08:00:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-06 08:00:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-06 08:00:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 08:00:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 08:00:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 08:00:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 08:00:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 08:00:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 08:00:37,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 08:00:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 08:00:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 08:00:37,115 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 08:00:37,236 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 08:00:37,238 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 08:00:37,477 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 08:00:37,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 08:00:37,511 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-06 08:00:37,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:00:37 BoogieIcfgContainer [2024-05-06 08:00:37,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 08:00:37,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 08:00:37,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 08:00:37,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 08:00:37,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 08:00:36" (1/3) ... [2024-05-06 08:00:37,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555654ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:00:37, skipping insertion in model container [2024-05-06 08:00:37,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:00:36" (2/3) ... [2024-05-06 08:00:37,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555654ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:00:37, skipping insertion in model container [2024-05-06 08:00:37,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:00:37" (3/3) ... [2024-05-06 08:00:37,519 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-05-06 08:00:37,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 08:00:37,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 08:00:37,533 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 08:00:37,533 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 08:00:37,594 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-06 08:00:37,624 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 08:00:37,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 08:00:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:00:37,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 08:00:37,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 08:00:37,676 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 08:00:37,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:00:37,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 08:00:37,701 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;@6c1bb06f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 08:00:37,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-06 08:00:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1012863253, now seen corresponding path program 1 times [2024-05-06 08:00:37,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 08:00:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 08:00:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 08:00:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 08:00:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1540021181, now seen corresponding path program 1 times [2024-05-06 08:00:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 08:00:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 08:00:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1597154508, now seen corresponding path program 1 times [2024-05-06 08:00:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 08:00:39,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 08:00:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 08:00:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash -153648971, now seen corresponding path program 2 times [2024-05-06 08:00:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:00:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:00:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1155650188, now seen corresponding path program 1 times [2024-05-06 08:00:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:00:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:00:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1851303999, now seen corresponding path program 2 times [2024-05-06 08:00:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 08:00:41,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 08:00:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 08:00:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash -258629273, now seen corresponding path program 1 times [2024-05-06 08:00:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:00:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:00:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 986693666, now seen corresponding path program 3 times [2024-05-06 08:00:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 08:00:43,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 08:00:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 08:00:44,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 08:00:44,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:00:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1856459753, now seen corresponding path program 1 times [2024-05-06 08:00:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:00:44,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104315932] [2024-05-06 08:00:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:00:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 173 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-06 08:00:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:00:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104315932] [2024-05-06 08:00:44,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104315932] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 08:00:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427224705] [2024-05-06 08:00:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:00:44,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 08:00:44,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:00:44,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 08:00:44,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 08:00:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:00:44,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-06 08:00:44,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 08:00:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-06 08:00:45,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 08:00:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-06 08:00:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427224705] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 08:00:46,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 08:00:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 51 [2024-05-06 08:00:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100846895] [2024-05-06 08:00:46,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 08:00:46,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-06 08:00:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:00:46,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-06 08:00:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2377, Unknown=0, NotChecked=0, Total=2550 [2024-05-06 08:00:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:00:46,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:00:46,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.686274509803922) internal successors, (392), 51 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:00:46,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:01:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-05-06 08:01:14,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-06 08:01:14,710 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,SelfDestructingSolverStorable13 [2024-05-06 08:01:14,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 08:01:14,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:01:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1547051283, now seen corresponding path program 2 times [2024-05-06 08:01:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:01:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290981504] [2024-05-06 08:01:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:01:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:01:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:01:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 304 proven. 570 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-05-06 08:01:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:01:16,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290981504] [2024-05-06 08:01:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290981504] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 08:01:16,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927390982] [2024-05-06 08:01:16,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 08:01:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 08:01:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:01:16,182 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-05-06 08:01:16,182 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-05-06 08:01:16,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 08:01:16,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 08:01:16,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-06 08:01:16,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 08:01:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 86 proven. 1302 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-06 08:01:17,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 08:01:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 86 proven. 1302 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-06 08:01:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927390982] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 08:01:22,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 08:01:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 49, 49] total 111 [2024-05-06 08:01:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107623865] [2024-05-06 08:01:22,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 08:01:22,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-05-06 08:01:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:01:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-05-06 08:01:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=11417, Unknown=0, NotChecked=0, Total=12210 [2024-05-06 08:01:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:01:22,298 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:01:22,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 6.378378378378378) internal successors, (708), 111 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:01:22,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2024-05-06 08:01:22,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:01:42,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ 5 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296)) (.cse7 (mod (+ 7 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296)) (.cse5 (+ (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse3 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) 1)) (.cse10 (mod |c_thread4Thread1of1ForFork3_~i~3#1| 4294967296)) (.cse13 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 11) 4294967296)) (.cse8 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) 1)) (.cse15 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (.cse0 (+ 1 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (.cse2 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 10) 4294967296)) (.cse1 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296)) (.cse12 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 4) 4294967296)) (.cse17 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) 1)) (.cse6 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 8) 4294967296)) (.cse11 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse14 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) 1)) (.cse16 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 3) 4294967296)) (.cse9 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) 1)) (.cse18 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 9) 4294967296))) (and (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 2) 4294967296) .cse0) (< .cse1 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) 1)) (< .cse2 .cse3) (< .cse4 (+ 1 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296))) (< .cse4 .cse5) (< .cse6 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) 1)) (< .cse1 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) 1)) (< .cse7 .cse8) (< .cse7 (+ (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) 1)) (< .cse6 .cse9) (< .cse4 .cse8) (< .cse10 (mod c_~N~0 4294967296)) (< .cse7 .cse11) (< .cse12 .cse5) (< .cse12 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) 1)) (< .cse13 .cse3) (< .cse2 .cse14) (< .cse10 .cse15) (< .cse13 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 6) 4294967296) .cse8) (< .cse1 .cse15) (< .cse16 .cse0) (< .cse16 .cse17) (< .cse1 .cse0) (< .cse2 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) 1)) (< .cse1 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) 1)) (< .cse12 .cse17) (< .cse6 .cse11) (< .cse18 .cse14) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< .cse16 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) 1)) (< .cse18 .cse9) (< .cse18 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) 1)))) is different from false [2024-05-06 08:03:37,915 WARN L293 SmtUtils]: Spent 40.73s on a formula simplification. DAG size of input: 83 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 08:05:08,238 WARN L293 SmtUtils]: Spent 28.22s on a formula simplification. DAG size of input: 83 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 08:05:56,644 WARN L293 SmtUtils]: Spent 13.93s on a formula simplification. DAG size of input: 65 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 08:07:43,398 WARN L293 SmtUtils]: Spent 25.15s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 08:07:44,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:07:47,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:07:49,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:07:50,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:09:55,435 WARN L293 SmtUtils]: Spent 39.15s on a formula simplification. DAG size of input: 97 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 08:09:57,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:09:59,981 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-05-06 08:10:04,516 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-05-06 08:12:05,223 WARN L293 SmtUtils]: Spent 30.25s on a formula simplification. DAG size of input: 90 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 08:12:06,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:08,489 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-05-06 08:12:11,391 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-05-06 08:12:13,395 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-05-06 08:12:17,724 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-05-06 08:12:19,730 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-05-06 08:12:22,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:24,924 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-05-06 08:12:28,648 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-05-06 08:12:30,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:32,881 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-05-06 08:12:36,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:38,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:40,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:42,522 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-05-06 08:12:43,562 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-05-06 08:12:47,262 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-05-06 08:12:53,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 08:12:56,342 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-05-06 08:12:58,345 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-05-06 08:13:01,233 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-05-06 08:13:04,732 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-05-06 08:13:06,736 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-05-06 08:13:07,766 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-05-06 08:13:10,855 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-05-06 08:13:12,862 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-05-06 08:13:14,865 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-05-06 08:13:16,760 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-05-06 08:13:18,884 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-05-06 08:13:20,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse3 (mod |c_thread4Thread1of1ForFork3_~i~3#1| 4294967296)) (.cse5 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (.cse6 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 3) 4294967296)) (.cse0 (+ 1 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (.cse2 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296)) (.cse4 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 4) 4294967296)) (.cse7 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) 1))) (and (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 2) 4294967296) .cse0) (< (mod (+ 5 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) .cse1) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) 1)) (< (mod (+ 7 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) 1)) (< .cse3 (mod c_~N~0 4294967296)) (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| (* 4294967296 (div c_~N~0 4294967296))) (+ c_~N~0 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)))) (< .cse4 .cse1) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 11) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 10) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) 1)) (< .cse3 .cse5) (< .cse2 .cse5) (< .cse6 .cse0) (< .cse6 .cse7) (< .cse2 .cse0) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) 1)) (< .cse4 .cse7) (= c_thread3Thread1of1ForFork1_~i~2 |c_thread2Thread1of1ForFork0_#t~post2#1|) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 8) 4294967296) (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 9) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) 1)))) is different from false [2024-05-06 08:14:54,909 WARN L293 SmtUtils]: Spent 29.13s on a formula simplification. DAG size of input: 80 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-06 08:15:10,019 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-05-06 08:15:10,056 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 08:15:10,059 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-05-06 08:15:11,081 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-05-06 08:15:11,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-06 08:15:11,220 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-06 08:15:11,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-06 08:15:11,228 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-06 08:15:11,229 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 137 [2024-05-06 08:15:11,232 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-06 08:15:11,232 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-06 08:15:11,232 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-06 08:15:11,232 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-06 08:15:11,232 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-06 08:15:11,235 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2024-05-06 08:15:11,237 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 08:15:11,237 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 08:15:11,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 08:15:11 BasicIcfg [2024-05-06 08:15:11,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 08:15:11,239 INFO L158 Benchmark]: Toolchain (without parser) took 874511.33ms. Allocated memory was 285.2MB in the beginning and 972.0MB in the end (delta: 686.8MB). Free memory was 212.2MB in the beginning and 609.1MB in the end (delta: -396.9MB). Peak memory consumption was 290.1MB. Max. memory is 8.0GB. [2024-05-06 08:15:11,239 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 157.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 08:15:11,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.33ms. Allocated memory is still 285.2MB. Free memory was 211.9MB in the beginning and 200.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-06 08:15:11,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.04ms. Allocated memory is still 285.2MB. Free memory was 200.4MB in the beginning and 198.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 08:15:11,240 INFO L158 Benchmark]: Boogie Preprocessor took 19.96ms. Allocated memory is still 285.2MB. Free memory was 198.6MB in the beginning and 197.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 08:15:11,240 INFO L158 Benchmark]: RCFGBuilder took 492.95ms. Allocated memory is still 285.2MB. Free memory was 197.0MB in the beginning and 245.0MB in the end (delta: -48.0MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2024-05-06 08:15:11,240 INFO L158 Benchmark]: TraceAbstraction took 873724.94ms. Allocated memory was 285.2MB in the beginning and 972.0MB in the end (delta: 686.8MB). Free memory was 244.0MB in the beginning and 609.1MB in the end (delta: -365.1MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB. [2024-05-06 08:15:11,241 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 157.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.33ms. Allocated memory is still 285.2MB. Free memory was 211.9MB in the beginning and 200.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.04ms. Allocated memory is still 285.2MB. Free memory was 200.4MB in the beginning and 198.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.96ms. Allocated memory is still 285.2MB. Free memory was 198.6MB in the beginning and 197.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 492.95ms. Allocated memory is still 285.2MB. Free memory was 197.0MB in the beginning and 245.0MB in the end (delta: -48.0MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * TraceAbstraction took 873724.94ms. Allocated memory was 285.2MB in the beginning and 972.0MB in the end (delta: 686.8MB). Free memory was 244.0MB in the beginning and 609.1MB in the end (delta: -365.1MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 742968, independent: 715260, independent conditional: 492482, independent unconditional: 222778, dependent: 27708, dependent conditional: 27044, dependent unconditional: 664, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 717931, independent: 715260, independent conditional: 492482, independent unconditional: 222778, dependent: 2671, dependent conditional: 2007, dependent unconditional: 664, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 717931, independent: 715260, independent conditional: 492482, independent unconditional: 222778, dependent: 2671, dependent conditional: 2007, dependent unconditional: 664, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 717931, independent: 715260, independent conditional: 492482, independent unconditional: 222778, dependent: 2671, dependent conditional: 2007, dependent unconditional: 664, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 721937, independent: 715260, independent conditional: 120255, independent unconditional: 595005, dependent: 6677, dependent conditional: 2679, dependent unconditional: 3998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 721937, independent: 715260, independent conditional: 71844, independent unconditional: 643416, dependent: 6677, dependent conditional: 0, dependent unconditional: 6677, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 721937, independent: 715260, independent conditional: 71844, independent unconditional: 643416, dependent: 6677, dependent conditional: 0, dependent unconditional: 6677, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1763, independent: 1755, independent conditional: 0, independent unconditional: 1755, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1763, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 721937, independent: 713505, independent conditional: 71844, independent unconditional: 641661, dependent: 6669, dependent conditional: 0, dependent unconditional: 6669, unknown: 1763, unknown conditional: 0, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 1763, Positive cache size: 1755, Positive conditional cache size: 0, Positive unconditional cache size: 1755, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51090, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 721937, independent: 715260, independent conditional: 120255, independent unconditional: 595005, dependent: 6677, dependent conditional: 2679, dependent unconditional: 3998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 721937, independent: 715260, independent conditional: 71844, independent unconditional: 643416, dependent: 6677, dependent conditional: 0, dependent unconditional: 6677, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 721937, independent: 715260, independent conditional: 71844, independent unconditional: 643416, dependent: 6677, dependent conditional: 0, dependent unconditional: 6677, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1763, independent: 1755, independent conditional: 0, independent unconditional: 1755, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1763, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 721937, independent: 713505, independent conditional: 71844, independent unconditional: 641661, dependent: 6669, dependent conditional: 0, dependent unconditional: 6669, unknown: 1763, unknown conditional: 0, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 1763, Positive cache size: 1755, Positive conditional cache size: 0, Positive unconditional cache size: 1755, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51090 ], Independence queries for same thread: 25037 - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: 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 9 procedures, 170 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 873.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 863.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: 248, 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.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1080 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 1614 ConstructedInterpolants, 0 QuantifiedInterpolants, 10701 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 6 InterpolantComputations, 0 PerfectInterpolantSequences, 1501/5226 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, ConditionalCommutativityCheckTime: 4.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 8, ConditionalCommutativityTraceChecks: 8, ConditionalCommutativityImperfectProofs: 4 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown