/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 RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 08:39:44,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 08:39:44,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 08:39:44,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 08:39:44,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 08:39:44,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 08:39:44,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 08:39:44,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 08:39:44,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 08:39:44,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 08:39:44,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 08:39:44,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 08:39:44,168 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 08:39:44,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 08:39:44,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 08:39:44,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 08:39:44,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 08:39:44,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 08:39:44,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 08:39:44,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 08:39:44,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 08:39:44,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 08:39:44,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 08:39:44,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 08:39:44,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 08:39:44,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 08:39:44,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 08:39:44,171 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 08:39:44,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 08:39:44,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 08:39:44,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 08:39:44,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 08:39:44,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 08:39:44,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 08:39:44,173 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 08:39:44,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 08:39:44,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 08:39:44,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 08:39:44,174 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 08:39:44,174 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-05 08:39:44,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 08:39:44,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 08:39:44,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 08:39:44,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 08:39:44,407 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 08:39:44,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-04-05 08:39:45,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 08:39:45,682 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 08:39:45,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-04-05 08:39:45,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ce53fbc10/2e1823758f5f4345bc78c9acacae8e0e/FLAG5d1aaae51 [2024-04-05 08:39:45,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ce53fbc10/2e1823758f5f4345bc78c9acacae8e0e [2024-04-05 08:39:45,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 08:39:45,709 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 08:39:45,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 08:39:45,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 08:39:45,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 08:39:45,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468a3412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45, skipping insertion in model container [2024-04-05 08:39:45,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,737 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 08:39:45,872 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/mult-comm.wvr.c[1910,1923] [2024-04-05 08:39:45,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 08:39:45,882 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 08:39:45,895 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/mult-comm.wvr.c[1910,1923] [2024-04-05 08:39:45,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 08:39:45,906 INFO L206 MainTranslator]: Completed translation [2024-04-05 08:39:45,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45 WrapperNode [2024-04-05 08:39:45,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 08:39:45,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 08:39:45,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 08:39:45,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 08:39:45,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,930 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-04-05 08:39:45,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 08:39:45,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 08:39:45,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 08:39:45,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 08:39:45,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 08:39:45,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 08:39:45,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 08:39:45,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 08:39:45,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (1/1) ... [2024-04-05 08:39:45,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 08:39:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:39:45,975 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 08:39:45,981 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 08:39:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 08:39:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 08:39:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 08:39:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 08:39:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 08:39:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 08:39:46,016 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 08:39:46,103 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 08:39:46,104 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 08:39:46,202 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 08:39:46,210 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 08:39:46,210 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 08:39:46,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 08:39:46 BoogieIcfgContainer [2024-04-05 08:39:46,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 08:39:46,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 08:39:46,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 08:39:46,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 08:39:46,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 08:39:45" (1/3) ... [2024-04-05 08:39:46,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d022a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 08:39:46, skipping insertion in model container [2024-04-05 08:39:46,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 08:39:45" (2/3) ... [2024-04-05 08:39:46,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d022a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 08:39:46, skipping insertion in model container [2024-04-05 08:39:46,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 08:39:46" (3/3) ... [2024-04-05 08:39:46,265 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-04-05 08:39:46,270 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 08:39:46,286 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 08:39:46,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 08:39:46,287 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 08:39:46,371 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 08:39:46,423 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 08:39:46,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 08:39:46,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:39:46,426 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 08:39:46,428 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 08:39:46,461 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 08:39:46,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:39:46,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 08:39:46,478 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;@5af4397d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 08:39:46,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 08:39:46,631 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 08:39:46,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:39:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 363226051, now seen corresponding path program 1 times [2024-04-05 08:39:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:39:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161465865] [2024-04-05 08:39:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:39:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:39:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:39:46,870 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 08:39:46,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:39:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161465865] [2024-04-05 08:39:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161465865] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 08:39:46,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 08:39:46,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 08:39:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382870137] [2024-04-05 08:39:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 08:39:46,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 08:39:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:39:46,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 08:39:46,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 08:39:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:46,904 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:39:46,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 08:39:46,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:46,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 08:39:46,962 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 08:39:46,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:39:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash 288843940, now seen corresponding path program 1 times [2024-04-05 08:39:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:39:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759004529] [2024-04-05 08:39:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:39:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:39:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:39:47,499 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 08:39:47,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:39:47,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759004529] [2024-04-05 08:39:47,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759004529] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 08:39:47,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671194478] [2024-04-05 08:39:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:39:47,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 08:39:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:39:47,543 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 08:39:47,568 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 08:39:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:39:47,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2024-04-05 08:39:47,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 08:39:47,926 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 08:39:47,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 08:39:48,234 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 08:39:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671194478] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 08:39:48,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 08:39:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 18 [2024-04-05 08:39:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115497220] [2024-04-05 08:39:48,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 08:39:48,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-05 08:39:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:39:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-05 08:39:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-04-05 08:39:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:48,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:39:48,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 18 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 08:39:48,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:48,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-05 08:39:48,380 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 08:39:48,577 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 08:39:48,577 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 08:39:48,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:39:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 871184985, now seen corresponding path program 1 times [2024-04-05 08:39:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:39:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994212945] [2024-04-05 08:39:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:39:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:39:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:39:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:39:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:39:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994212945] [2024-04-05 08:39:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994212945] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 08:39:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683804649] [2024-04-05 08:39:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:39:50,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 08:39:50,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:39:50,955 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 08:39:50,962 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 08:39:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:39:51,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 37 conjunts are in the unsatisfiable core [2024-04-05 08:39:51,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 08:39:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:39:51,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 08:39:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:39:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683804649] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 08:39:58,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 08:39:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 47 [2024-04-05 08:39:58,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223199128] [2024-04-05 08:39:58,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 08:39:58,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-04-05 08:39:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:39:58,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-04-05 08:39:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2024-04-05 08:39:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:58,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:39:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.0425531914893615) internal successors, (143), 47 states have internal predecessors, (143), 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 08:39:58,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:39:58,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-05 08:39:58,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:40:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:40:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-05 08:40:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-04-05 08:40:31,736 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-04-05 08:40:31,927 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 08:40:31,927 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 08:40:31,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 08:40:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1295183101, now seen corresponding path program 2 times [2024-04-05 08:40:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 08:40:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757092016] [2024-04-05 08:40:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 08:40:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 08:40:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 08:40:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:40:40,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 08:40:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757092016] [2024-04-05 08:40:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757092016] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 08:40:40,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397762355] [2024-04-05 08:40:40,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 08:40:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 08:40:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 08:40:40,809 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 08:40:40,810 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 08:40:41,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 08:40:41,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 08:40:41,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 08:40:41,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 08:40:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:40:54,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 08:43:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 08:43:00,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397762355] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 08:43:00,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 08:43:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 83 [2024-04-05 08:43:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442400155] [2024-04-05 08:43:00,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 08:43:00,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-04-05 08:43:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 08:43:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-04-05 08:43:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=6385, Unknown=30, NotChecked=0, Total=6806 [2024-04-05 08:43:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:00,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 08:43:00,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 2.433734939759036) internal successors, (202), 83 states have internal predecessors, (202), 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 08:43:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-05 08:43:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-04-05 08:43:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 08:43:57,806 WARN L293 SmtUtils]: Spent 15.57s on a formula simplification. DAG size of input: 162 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:44:44,124 WARN L293 SmtUtils]: Spent 27.68s on a formula simplification. DAG size of input: 208 DAG size of output: 140 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:45:02,734 WARN L293 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 226 DAG size of output: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:45:35,364 WARN L293 SmtUtils]: Spent 13.07s on a formula simplification. DAG size of input: 219 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:46:35,065 WARN L293 SmtUtils]: Spent 41.48s on a formula simplification. DAG size of input: 199 DAG size of output: 141 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:46:37,074 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 08:46:39,154 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 [1] [2024-04-05 08:46:43,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 08:47:12,604 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 [1] [2024-04-05 08:47:41,238 WARN L293 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 191 DAG size of output: 100 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:48:06,899 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 [1] [2024-04-05 08:48:08,919 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 08:48:11,361 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 08:48:13,875 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 08:48:28,768 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 08:48:43,249 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 [1] [2024-04-05 08:48:46,129 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 08:48:47,137 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 08:49:04,908 WARN L293 SmtUtils]: Spent 11.23s on a formula simplification. DAG size of input: 151 DAG size of output: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:49:07,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 08:49:34,258 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 08:50:12,917 WARN L293 SmtUtils]: Spent 30.12s on a formula simplification. DAG size of input: 162 DAG size of output: 141 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:50:32,113 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 109 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 08:50:41,328 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 08:50:42,869 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-04-05 08:50:45,437 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse45 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse32 (* 4 c_~a~0)) (.cse35 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (* 2 c_~b~0)) (.cse29 (* 2 c_~a~0))) (let ((.cse30 (* (div (+ c_~x_1~0 .cse29) 4294967296) 4294967296)) (.cse7 (* (div (+ c_~x_2~0 .cse5) 4294967296) 4294967296)) (.cse16 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse18 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse40 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse8 (* 3 c_~a~0)) (.cse23 (+ .cse35 1)) (.cse24 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse31 (* (div (+ .cse32 c_~x_1~0) 4294967296) 4294967296)) (.cse42 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse28 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296)) (.cse43 (* (div (+ c_~x_1~0 c_~a~0) 4294967296) 4294967296)) (.cse21 (mod c_~a~0 4294967296)) (.cse20 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse17 (mod c_~b~0 4294967296)) (.cse34 (+ .cse45 1))) (let ((.cse1 (< .cse17 .cse34)) (.cse4 (< .cse35 .cse17)) (.cse13 (< .cse21 (+ .cse20 1))) (.cse15 (= (+ .cse28 c_~x_1~0 c_~a~0) (+ c_~x_2~0 c_~b~0 .cse43))) (.cse12 (< .cse17 (+ .cse42 1))) (.cse14 (< .cse45 .cse17)) (.cse26 (forall ((v_z_23 Int)) (or (< v_z_23 .cse23) (< .cse24 v_z_23) (let ((.cse44 (* v_z_23 3))) (= (+ .cse31 c_~x_2~0 .cse44) (+ .cse32 c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse44) 4294967296)))))))) (.cse33 (not (= .cse21 3))) (.cse6 (* (div (+ c_~x_1~0 .cse8) 4294967296) 4294967296)) (.cse9 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse21)) (.cse10 (< .cse21 (+ .cse40 1))) (.cse11 (< .cse41 .cse21)) (.cse19 (= (+ c_~x_2~0 .cse43) (+ c_~x_1~0 .cse18 c_~a~0))) (.cse37 (< .cse17 (+ .cse16 1))) (.cse22 (< .cse42 .cse17)) (.cse38 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse0 (< .cse21 (+ .cse41 1))) (.cse2 (= (+ c_~x_2~0 .cse30 .cse5) (+ .cse7 c_~x_1~0 .cse29))) (.cse27 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse3 (< .cse40 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (= c_~x_2~0 .cse5) (or (= (+ c_~x_2~0 .cse6 .cse5) (+ .cse7 c_~x_1~0 .cse8)) .cse1 .cse9 .cse4 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse15) (or (< .cse16 .cse17) (= (+ c_~x_1~0 .cse18) (+ c_~x_2~0 (* 4294967296 (div c_~x_1~0 4294967296))))) (or .cse19 (< .cse20 .cse21) .cse22) (or (forall ((v_z_23 Int)) (or (< v_z_23 .cse23) (< .cse24 v_z_23) (let ((.cse25 (* v_z_23 3))) (= (+ c_~x_1~0 .cse8 (* 4294967296 (div (+ c_~x_2~0 .cse25) 4294967296))) (+ c_~x_2~0 .cse25 .cse6))))) .cse9 .cse10) (= 2 c_thread1Thread1of1ForFork0_~i~0) (or .cse9 .cse26 .cse10) (or .cse11 (< .cse17 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) 1)) (< .cse27 .cse17) .cse13 .cse15) (or .cse0 .cse12 (= (+ .cse28 c_~x_1~0 .cse29) (+ c_~x_2~0 .cse30 c_~b~0)) .cse3 .cse14) (or (= (+ .cse31 c_~x_2~0 12) (+ .cse32 c_~x_1~0 (* (div (+ c_~x_2~0 12) 4294967296) 4294967296))) .cse33) (or (forall ((v_z_23 Int)) (or (< v_z_23 .cse34) (< .cse35 v_z_23) (let ((.cse36 (* v_z_23 3))) (= (+ c_~x_1~0 .cse8 (* 4294967296 (div (+ c_~x_2~0 .cse36) 4294967296))) (+ c_~x_2~0 .cse36 .cse6))))) .cse9 .cse10) (or .cse26 .cse33) (= 2 c_thread2Thread1of1ForFork1_~i~1) (or .cse19 (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse21) .cse37 .cse22) (= c_~x_1~0 .cse29) (or (forall ((v_z_23 Int)) (or (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296) v_z_23) (< v_z_23 (+ .cse38 1)) (let ((.cse39 (* v_z_23 3))) (= (+ c_~x_1~0 .cse8 (* 4294967296 (div (+ c_~x_2~0 .cse39) 4294967296))) (+ c_~x_2~0 .cse39 .cse6))))) .cse9 .cse10) (or .cse11 .cse19 .cse37 .cse22) (or (< .cse38 .cse17) .cse0 .cse2 (< .cse17 (+ .cse27 1)) .cse3))))) is different from false [2024-04-05 08:50:47,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 08:50:49,384 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 08:50:55,837 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 08:50:57,975 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 08:51:00,019 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 08:51:20,664 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 08:51:22,932 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 08:51:23,981 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 08:51:37,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 08:51:39,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 08:51:46,547 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 08:51:47,586 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 08:52:04,208 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 08:52:17,900 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 08:52:20,322 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 08:52:23,600 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 [1] [2024-04-05 08:52:26,532 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 [1] [2024-04-05 08:52:28,295 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-04-05 08:52:56,650 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-04-05 08:52:58,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 08:53:15,694 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 08:53:17,973 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 08:53:27,301 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 08:53:29,791 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-04-05 08:53:39,002 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 08:53:43,767 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 08:54:00,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-04-05 08:54:23,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 08:54:23,195 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 08:54:23,195 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 08:54:23,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-05 08:54:23,417 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 08:54:23,417 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. [2024-04-05 08:54:23,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 08:54:23,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 08:54:23,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 08:54:23,423 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-04-05 08:54:23,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 08:54:23,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 08:54:23,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 08:54:23 BasicIcfg [2024-04-05 08:54:23,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 08:54:23,427 INFO L158 Benchmark]: Toolchain (without parser) took 877717.86ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 87.1MB in the beginning and 156.2MB in the end (delta: -69.1MB). Peak memory consumption was 143.7MB. Max. memory is 8.0GB. [2024-04-05 08:54:23,427 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 151.0MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 08:54:23,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.02ms. Allocated memory is still 151.0MB. Free memory was 86.9MB in the beginning and 76.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-05 08:54:23,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.92ms. Allocated memory is still 151.0MB. Free memory was 76.0MB in the beginning and 74.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 08:54:23,428 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 151.0MB. Free memory was 74.5MB in the beginning and 73.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 08:54:23,428 INFO L158 Benchmark]: RCFGBuilder took 263.85ms. Allocated memory is still 151.0MB. Free memory was 73.1MB in the beginning and 60.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-05 08:54:23,429 INFO L158 Benchmark]: TraceAbstraction took 877166.84ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 126.9MB in the beginning and 156.2MB in the end (delta: -29.3MB). Peak memory consumption was 182.5MB. Max. memory is 8.0GB. [2024-04-05 08:54:23,430 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.08ms. Allocated memory is still 151.0MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.02ms. Allocated memory is still 151.0MB. Free memory was 86.9MB in the beginning and 76.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.92ms. Allocated memory is still 151.0MB. Free memory was 76.0MB in the beginning and 74.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 151.0MB. Free memory was 74.5MB in the beginning and 73.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 263.85ms. Allocated memory is still 151.0MB. Free memory was 73.1MB in the beginning and 60.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 877166.84ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 126.9MB in the beginning and 156.2MB in the end (delta: -29.3MB). Peak memory consumption was 182.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2826, independent: 1971, independent conditional: 1725, independent unconditional: 246, dependent: 855, dependent conditional: 690, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1971, independent: 1971, independent conditional: 1725, independent unconditional: 246, 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: 1971, independent: 1971, independent conditional: 1725, independent unconditional: 246, 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: 1971, independent: 1971, independent conditional: 1725, independent unconditional: 246, 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: 1971, independent: 1971, independent conditional: 288, independent unconditional: 1683, 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: 1971, independent: 1971, independent conditional: 282, independent unconditional: 1689, 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: 1971, independent: 1971, independent conditional: 282, independent unconditional: 1689, 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: 151, independent: 151, independent conditional: 0, independent unconditional: 151, 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: 151, independent: 151, independent conditional: 0, independent unconditional: 151, 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: 1971, independent: 1820, independent conditional: 282, independent unconditional: 1538, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 151, unknown conditional: 0, unknown unconditional: 151] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, 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: 1971, independent: 1971, independent conditional: 288, independent unconditional: 1683, 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: 1971, independent: 1971, independent conditional: 282, independent unconditional: 1689, 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: 1971, independent: 1971, independent conditional: 282, independent unconditional: 1689, 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: 151, independent: 151, independent conditional: 0, independent unconditional: 151, 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: 151, independent: 151, independent conditional: 0, independent unconditional: 151, 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: 1971, independent: 1820, independent conditional: 282, independent unconditional: 1538, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 151, unknown conditional: 0, unknown unconditional: 151] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, 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: 855 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 98 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 877.0s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 716.5s, 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: 200, 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.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 158.1s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 711 ConstructedInterpolants, 17 QuantifiedInterpolants, 15331 SizeOfPredicates, 49 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 1/184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2024-04-05 08:54:23,448 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