/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 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 06:14:13,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 06:14:13,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 06:14:13,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 06:14:13,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 06:14:13,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 06:14:13,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 06:14:13,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 06:14:13,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 06:14:13,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 06:14:13,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 06:14:13,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 06:14:13,513 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 06:14:13,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 06:14:13,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 06:14:13,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 06:14:13,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 06:14:13,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 06:14:13,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 06:14:13,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 06:14:13,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 06:14:13,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 06:14:13,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 06:14:13,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 06:14:13,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 06:14:13,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 06:14:13,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 06:14:13,518 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 06:14:13,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 06:14:13,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 06:14:13,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 06:14:13,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 06:14:13,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 06:14:13,521 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 -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-05 06:14:13,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 06:14:13,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 06:14:13,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 06:14:13,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 06:14:13,836 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 06:14:13,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-04-05 06:14:14,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 06:14:15,156 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 06:14:15,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-04-05 06:14:15,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/63325c133/f4cc1d602ac5463f8c6ac4b41979b954/FLAGd44c9be8d [2024-04-05 06:14:15,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/63325c133/f4cc1d602ac5463f8c6ac4b41979b954 [2024-04-05 06:14:15,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 06:14:15,178 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 06:14:15,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 06:14:15,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 06:14:15,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 06:14:15,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78317f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15, skipping insertion in model container [2024-04-05 06:14:15,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,203 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 06:14:15,355 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-04-05 06:14:15,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 06:14:15,368 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 06:14:15,383 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-04-05 06:14:15,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 06:14:15,391 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 06:14:15,391 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 06:14:15,397 INFO L206 MainTranslator]: Completed translation [2024-04-05 06:14:15,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15 WrapperNode [2024-04-05 06:14:15,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 06:14:15,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 06:14:15,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 06:14:15,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 06:14:15,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,425 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-04-05 06:14:15,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 06:14:15,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 06:14:15,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 06:14:15,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 06:14:15,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 06:14:15,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 06:14:15,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 06:14:15,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 06:14:15,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (1/1) ... [2024-04-05 06:14:15,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 06:14:15,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:14:15,476 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 06:14:15,481 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 06:14:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 06:14:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 06:14:15,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 06:14:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 06:14:15,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 06:14:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 06:14:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 06:14:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 06:14:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 06:14:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 06:14:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 06:14:15,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 06:14:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 06:14:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 06:14:15,522 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 06:14:15,597 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 06:14:15,599 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 06:14:15,733 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 06:14:15,788 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 06:14:15,788 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 06:14:15,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:14:15 BoogieIcfgContainer [2024-04-05 06:14:15,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 06:14:15,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 06:14:15,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 06:14:15,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 06:14:15,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:14:15" (1/3) ... [2024-04-05 06:14:15,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56257166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:14:15, skipping insertion in model container [2024-04-05 06:14:15,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:14:15" (2/3) ... [2024-04-05 06:14:15,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56257166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:14:15, skipping insertion in model container [2024-04-05 06:14:15,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:14:15" (3/3) ... [2024-04-05 06:14:15,797 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2024-04-05 06:14:15,812 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 06:14:15,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 06:14:15,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 06:14:15,821 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 06:14:15,869 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 06:14:15,901 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 06:14:15,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 06:14:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:14:15,902 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 06:14:15,904 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 06:14:15,946 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 06:14:15,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:14:15,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 06:14:15,970 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;@7b5e53dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213 [2024-04-05 06:14:15,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 06:14:16,222 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 06:14:16,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:14:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1170405292, now seen corresponding path program 1 times [2024-04-05 06:14:16,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:14:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535147897] [2024-04-05 06:14:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:14:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:14:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:14:16,464 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 06:14:16,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:14:16,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535147897] [2024-04-05 06:14:16,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535147897] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 06:14:16,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 06:14:16,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 06:14:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188950331] [2024-04-05 06:14:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 06:14:16,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 06:14:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:14:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 06:14:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 06:14:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:16,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:14:16,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 06:14:16,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:16,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 06:14:16,646 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 06:14:16,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:14:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2044128722, now seen corresponding path program 1 times [2024-04-05 06:14:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:14:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399919694] [2024-04-05 06:14:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:14:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:14:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:14:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:14:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399919694] [2024-04-05 06:14:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399919694] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 06:14:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 06:14:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 06:14:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363587136] [2024-04-05 06:14:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 06:14:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 06:14:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:14:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 06:14:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-04-05 06:14:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:16,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:14:16,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 06:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:14:17,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 06:14:17,172 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 06:14:17,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:14:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 849842810, now seen corresponding path program 1 times [2024-04-05 06:14:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:14:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785835291] [2024-04-05 06:14:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:14:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:14:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:14:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:14:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785835291] [2024-04-05 06:14:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785835291] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 06:14:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756449009] [2024-04-05 06:14:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:14:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:14:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:14:17,818 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 06:14:17,820 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 06:14:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:14:17,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-05 06:14:17,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 06:14:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:18,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 06:14:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756449009] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 06:14:18,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 06:14:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-04-05 06:14:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210350650] [2024-04-05 06:14:18,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 06:14:18,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-04-05 06:14:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:14:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-04-05 06:14:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-04-05 06:14:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:18,696 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:14:18,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 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 06:14:18,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:18,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:14:18,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:14:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-05 06:14:19,580 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 06:14:19,771 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,SelfDestructingSolverStorable2 [2024-04-05 06:14:19,771 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 06:14:19,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:14:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -470519814, now seen corresponding path program 2 times [2024-04-05 06:14:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:14:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974382440] [2024-04-05 06:14:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:14:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:14:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:14:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:14:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974382440] [2024-04-05 06:14:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974382440] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 06:14:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310982421] [2024-04-05 06:14:20,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 06:14:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:14:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:14:20,951 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 06:14:20,969 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 06:14:21,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 06:14:21,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 06:14:21,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 30 conjunts are in the unsatisfiable core [2024-04-05 06:14:21,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 06:14:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:22,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 06:14:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:14:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310982421] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 06:14:26,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 06:14:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 20] total 52 [2024-04-05 06:14:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338658680] [2024-04-05 06:14:26,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 06:14:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-05 06:14:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:14:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-05 06:14:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2224, Unknown=0, NotChecked=0, Total=2652 [2024-04-05 06:14:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:26,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:14:26,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 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 06:14:26,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:26,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:14:26,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-05 06:14:26,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:14:52,211 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 101 DAG size of output: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:15:07,378 WARN L293 SmtUtils]: Spent 13.88s on a formula simplification. DAG size of input: 101 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:15:40,709 WARN L293 SmtUtils]: Spent 16.26s on a formula simplification. DAG size of input: 118 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:15:42,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 06:15:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:15:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:15:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 06:15:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-04-05 06:15:45,000 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 06:15:45,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:15:45,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 06:15:45,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:15:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash 696235753, now seen corresponding path program 3 times [2024-04-05 06:15:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:15:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762035598] [2024-04-05 06:15:45,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:15:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:15:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:15:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:15:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:15:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762035598] [2024-04-05 06:15:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762035598] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 06:15:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906124024] [2024-04-05 06:15:49,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 06:15:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:15:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:15:49,801 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 06:15:49,808 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 06:15:50,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-05 06:15:50,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 06:15:50,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 06:15:50,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 06:15:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 06:15:59,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 06:16:36,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* (div (* (- 1) c_~counter~0) 4294967296) 4294967296) (* (div c_~counter~0 4294967296) 4294967296) 4294967297)) (.cse2 (mod c_~counter~0 4294967296))) (and (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse0 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse0) .cse1) (< 4294967295 (+ (mod (+ 4294967295 c_~counter~0) 4294967296) v_z_48)) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse2 .cse0)) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))) (forall ((v_z_41 Int)) (let ((.cse3 (* v_z_41 4294967295))) (let ((.cse4 (+ .cse3 c_~counter~0))) (or (< v_z_41 0) (< (mod (+ c_~counter~0 (* v_z_41 4294967294)) 4294967296) 1) (< (+ (* (div (+ (- 1) .cse3 c_~counter~0) 4294967296) 4294967296) 4294967295) .cse4) (< (+ (* (div .cse4 4294967296) 4294967296) 4294967295) (+ (* v_z_41 4294967296) c_~counter~0)))))) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse5 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse5) .cse1) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse2 .cse5)) (< 4294967295 v_z_48) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))))) is different from false [2024-04-05 06:16:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 58 trivial. 5 not checked. [2024-04-05 06:16:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906124024] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 06:16:44,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 06:16:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 18, 11] total 51 [2024-04-05 06:16:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069797339] [2024-04-05 06:16:44,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 06:16:44,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-04-05 06:16:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:16:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-04-05 06:16:44,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2226, Unknown=2, NotChecked=96, Total=2550 [2024-04-05 06:16:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:16:44,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:16:44,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.372549019607843) internal successors, (223), 51 states have internal predecessors, (223), 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 06:16:44,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:16:44,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:16:44,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-05 06:16:44,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-04-05 06:16:44,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:18:48,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 06:20:53,001 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 06:20:59,711 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 06:21:04,044 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 06:21:06,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~counter~0 4294967296))) (let ((.cse1 (* .cse0 4294967296))) (let ((.cse3 (= c_~counter~0 0)) (.cse6 (+ (* (div (* (- 1) c_~counter~0) 4294967296) 4294967296) .cse1 4294967297)) (.cse4 (mod c_~counter~0 4294967296))) (and (or (< (+ c_thread2Thread1of1ForFork1_~i~1 (* (div c_~M~0 4294967296) 4294967296)) c_~M~0) (and (<= 0 .cse0) (<= c_~counter~0 .cse1))) (let ((.cse2 (= 3 c_thread1Thread1of1ForFork0_~i~0))) (or (and (= c_thread2Thread1of1ForFork1_~i~1 1) .cse2) (and .cse2 (= 2 c_thread2Thread1of1ForFork1_~i~1)) (and (<= 3 c_thread2Thread1of1ForFork1_~i~1) (<= c_thread2Thread1of1ForFork1_~i~1 c_thread1Thread1of1ForFork0_~i~0) .cse3) (and .cse2 (= c_thread2Thread1of1ForFork1_~i~1 0)))) (or (and (<= 1 (mod c_~C~0 4294967296)) .cse3) (and (<= .cse4 0) (= c_~counter~0 (* c_~C~0 3)))) (<= 0 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse5 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse5) .cse6) (< 4294967295 (+ (mod (+ 4294967295 c_~counter~0) 4294967296) v_z_48)) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse4 .cse5)) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))) (<= c_thread1Thread1of1ForFork0_~i~0 3) (forall ((v_z_41 Int)) (let ((.cse7 (* v_z_41 4294967295))) (let ((.cse8 (+ .cse7 c_~counter~0))) (or (< v_z_41 0) (< (mod (+ c_~counter~0 (* v_z_41 4294967294)) 4294967296) 1) (< (+ (* (div (+ (- 1) .cse7 c_~counter~0) 4294967296) 4294967296) 4294967295) .cse8) (< (+ (* (div .cse8 4294967296) 4294967296) 4294967295) (+ (* v_z_41 4294967296) c_~counter~0)))))) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse9 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse9) .cse6) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse4 .cse9)) (< 4294967295 v_z_48) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))))))) is different from false [2024-04-05 06:21:08,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 [] [2024-04-05 06:21:10,368 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 06:21:12,461 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 06:21:16,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:21:17,788 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 06:21:23,348 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 06:21:37,703 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 06:21:46,149 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 06:21:48,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~counter~0 4294967296))) (let ((.cse1 (* .cse0 4294967296))) (let ((.cse2 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (+ (* (div (* (- 1) c_~counter~0) 4294967296) 4294967296) .cse1 4294967297)) (.cse5 (mod c_~counter~0 4294967296)) (.cse7 (= c_~counter~0 0))) (and (or (< (+ c_thread2Thread1of1ForFork1_~i~1 (* (div c_~M~0 4294967296) 4294967296)) c_~M~0) (and (<= 0 .cse0) (<= c_~counter~0 .cse1))) (<= c_thread1Thread1of1ForFork0_~i~0 (+ (* .cse2 4294967296) 4294967294)) (<= 0 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse3 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse3) .cse4) (< 4294967295 (+ (mod (+ 4294967295 c_~counter~0) 4294967296) v_z_48)) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse5 .cse3)) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))) (or (and (<= 3 c_thread1Thread1of1ForFork0_~i~0) (= 2 c_thread2Thread1of1ForFork1_~i~1)) (and (or (< 0 c_thread2Thread1of1ForFork1_~i~1) (= c_thread2Thread1of1ForFork1_~i~1 0)) (<= (+ 2 c_thread2Thread1of1ForFork1_~i~1) c_thread1Thread1of1ForFork0_~i~0)) (let ((.cse6 (< c_thread2Thread1of1ForFork1_~i~1 c_thread1Thread1of1ForFork0_~i~0))) (and (or .cse6 .cse7) (or .cse6 (< 3 c_thread2Thread1of1ForFork1_~i~1)) (<= 3 c_thread2Thread1of1ForFork1_~i~1) (<= c_thread2Thread1of1ForFork1_~i~1 c_thread1Thread1of1ForFork0_~i~0)))) (<= .cse2 0) (forall ((v_z_41 Int)) (let ((.cse8 (* v_z_41 4294967295))) (let ((.cse9 (+ .cse8 c_~counter~0))) (or (< v_z_41 0) (< (mod (+ c_~counter~0 (* v_z_41 4294967294)) 4294967296) 1) (< (+ (* (div (+ (- 1) .cse8 c_~counter~0) 4294967296) 4294967296) 4294967295) .cse9) (< (+ (* (div .cse9 4294967296) 4294967296) 4294967295) (+ (* v_z_41 4294967296) c_~counter~0)))))) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse10 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse10) .cse4) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse5 .cse10)) (< 4294967295 v_z_48) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))) (or (and (<= 1 (mod c_~C~0 4294967296)) .cse7) (and (= (* c_~C~0 4) c_~counter~0) (<= (mod (* c_~C~0 3) 4294967296) 0))))))) is different from false [2024-04-05 06:21:53,246 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 06:21:56,192 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 06:21:59,918 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 06:22:07,367 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 06:22:15,906 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 06:22:21,757 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 06:22:26,423 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 06:22:28,756 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 06:22:31,000 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 06:22:33,465 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* (div (* (- 1) c_~counter~0) 4294967296) 4294967296) (* (div c_~counter~0 4294967296) 4294967296) 4294967297)) (.cse0 (mod c_~counter~0 4294967296))) (and (= .cse0 0) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse1 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse1) .cse2) (< 4294967295 (+ (mod (+ 4294967295 c_~counter~0) 4294967296) v_z_48)) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse0 .cse1)) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))) (forall ((v_z_41 Int)) (let ((.cse3 (* v_z_41 4294967295))) (let ((.cse4 (+ .cse3 c_~counter~0))) (or (< v_z_41 0) (< (mod (+ c_~counter~0 (* v_z_41 4294967294)) 4294967296) 1) (< (+ (* (div (+ (- 1) .cse3 c_~counter~0) 4294967296) 4294967296) 4294967295) .cse4) (< (+ (* (div .cse4 4294967296) 4294967296) 4294967295) (+ (* v_z_41 4294967296) c_~counter~0)))))) (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse5 (* v_y_48 4294967296))) (or (< (+ v_z_48 .cse5) .cse2) (< v_z_48 0) (< 4294967295 (+ v_z_48 .cse0 .cse5)) (< 4294967295 v_z_48) (< (mod (+ c_~counter~0 (* v_z_48 2)) 4294967296) 1)))))) is different from false [2024-04-05 06:23:18,222 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:23:20,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:23:22,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:23:24,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:23:26,577 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 06:23:28,602 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 06:23:30,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:23:32,634 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 06:23:34,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:23:36,144 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 [1] [2024-04-05 06:23:44,957 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 06:23:47,970 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 06:23:49,983 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 [1] [2024-04-05 06:23:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:23:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:23:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-05 06:23:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-04-05 06:23:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-04-05 06:23:57,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 06:23:57,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:23:57,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 06:23:57,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:23:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 435954601, now seen corresponding path program 4 times [2024-04-05 06:23:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:23:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896234262] [2024-04-05 06:23:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:23:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:23:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2024-04-05 06:28:27,669 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 06:28:27,676 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 06:28:27,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 06:28:27,677 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 123 with TraceHistMax 9,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-5-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 context. [2024-04-05 06:28:27,679 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 06:28:27,679 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 06:28:27,680 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 06:28:27,683 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2024-04-05 06:28:27,687 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 06:28:27,687 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 06:28:27,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:28:27 BasicIcfg [2024-04-05 06:28:27,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 06:28:27,691 INFO L158 Benchmark]: Toolchain (without parser) took 852511.79ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 855.6MB). Free memory was 215.6MB in the beginning and 577.9MB in the end (delta: -362.3MB). Peak memory consumption was 675.2MB. Max. memory is 8.0GB. [2024-04-05 06:28:27,692 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 287.3MB. Free memory is still 255.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 06:28:27,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.47ms. Allocated memory is still 287.3MB. Free memory was 215.5MB in the beginning and 204.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-05 06:28:27,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.77ms. Allocated memory is still 287.3MB. Free memory was 204.3MB in the beginning and 202.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 06:28:27,693 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 287.3MB. Free memory was 202.7MB in the beginning and 201.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 06:28:27,693 INFO L158 Benchmark]: RCFGBuilder took 342.03ms. Allocated memory is still 287.3MB. Free memory was 201.3MB in the beginning and 254.8MB in the end (delta: -53.4MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. [2024-04-05 06:28:27,693 INFO L158 Benchmark]: TraceAbstraction took 851896.82ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 855.6MB). Free memory was 253.7MB in the beginning and 577.9MB in the end (delta: -324.2MB). Peak memory consumption was 712.0MB. Max. memory is 8.0GB. [2024-04-05 06:28:27,695 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.12ms. Allocated memory is still 287.3MB. Free memory is still 255.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.47ms. Allocated memory is still 287.3MB. Free memory was 215.5MB in the beginning and 204.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.77ms. Allocated memory is still 287.3MB. Free memory was 204.3MB in the beginning and 202.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 287.3MB. Free memory was 202.7MB in the beginning and 201.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 342.03ms. Allocated memory is still 287.3MB. Free memory was 201.3MB in the beginning and 254.8MB in the end (delta: -53.4MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. * TraceAbstraction took 851896.82ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 855.6MB). Free memory was 253.7MB in the beginning and 577.9MB in the end (delta: -324.2MB). Peak memory consumption was 712.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3370, independent: 2433, independent conditional: 2192, independent unconditional: 241, dependent: 937, dependent conditional: 790, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2449, independent: 2433, independent conditional: 2192, independent unconditional: 241, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2449, independent: 2433, independent conditional: 2192, independent unconditional: 241, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2449, independent: 2433, independent conditional: 2192, independent unconditional: 241, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2495, independent: 2433, independent conditional: 428, independent unconditional: 2005, dependent: 62, dependent conditional: 30, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2495, independent: 2433, independent conditional: 384, independent unconditional: 2049, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2495, independent: 2433, independent conditional: 384, independent unconditional: 2049, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 158, independent: 149, independent conditional: 2, independent unconditional: 147, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 158, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 86, dependent conditional: 43, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2495, independent: 2284, independent conditional: 382, independent unconditional: 1902, dependent: 53, dependent conditional: 19, dependent unconditional: 34, unknown: 158, unknown conditional: 9, unknown unconditional: 149] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 149, Positive conditional cache size: 2, Positive unconditional cache size: 147, Negative cache size: 9, Negative conditional cache size: 7, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2495, independent: 2433, independent conditional: 428, independent unconditional: 2005, dependent: 62, dependent conditional: 30, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2495, independent: 2433, independent conditional: 384, independent unconditional: 2049, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2495, independent: 2433, independent conditional: 384, independent unconditional: 2049, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 158, independent: 149, independent conditional: 2, independent unconditional: 147, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 158, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 86, dependent conditional: 43, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2495, independent: 2284, independent conditional: 382, independent unconditional: 1902, dependent: 53, dependent conditional: 19, dependent unconditional: 34, unknown: 158, unknown conditional: 9, unknown unconditional: 149] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 149, Positive conditional cache size: 2, Positive unconditional cache size: 147, Negative cache size: 9, Negative conditional cache size: 7, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48 ], Independence queries for same thread: 921 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 123 with TraceHistMax 9,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-5-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 context. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 123 with TraceHistMax 9,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-5-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 context. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 123 with TraceHistMax 9,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-5-9-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-12-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-11-2-10-2-10-2-10-2-10-2-9-2-9-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-8-2-7-2-6-2-6-2-6-2-6-2-6-2-6-2-6-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-2-5-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 96 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 851.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 512.9s, 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: 172, 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.9s SatisfiabilityAnalysisTime, 67.0s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 890 ConstructedInterpolants, 35 QuantifiedInterpolants, 15954 SizeOfPredicates, 39 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 115/506 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