/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 23:26:36,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 23:26:36,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 23:26:36,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 23:26:36,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 23:26:36,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 23:26:36,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 23:26:36,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 23:26:36,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 23:26:36,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 23:26:36,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 23:26:36,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 23:26:36,402 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 23:26:36,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 23:26:36,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 23:26:36,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 23:26:36,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 23:26:36,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 23:26:36,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 23:26:36,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 23:26:36,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 23:26:36,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 23:26:36,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 23:26:36,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 23:26:36,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 23:26:36,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 23:26:36,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 23:26:36,407 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 23:26:36,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 23:26:36,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 23:26:36,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 23:26:36,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 23:26:36,410 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 23:26:36,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-04 23:26:36,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 23:26:36,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 23:26:36,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 23:26:36,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 23:26:36,684 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 23:26:36,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-04-04 23:26:37,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 23:26:38,032 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 23:26:38,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-04-04 23:26:38,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/052139a00/cb45fe8306414c1bbe7ea612dff176e4/FLAG1582d313b [2024-04-04 23:26:38,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/052139a00/cb45fe8306414c1bbe7ea612dff176e4 [2024-04-04 23:26:38,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 23:26:38,057 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 23:26:38,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 23:26:38,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 23:26:38,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 23:26:38,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7556928a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38, skipping insertion in model container [2024-04-04 23:26:38,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,082 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 23:26:38,232 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/parallel-misc-2.wvr.c[2554,2567] [2024-04-04 23:26:38,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 23:26:38,242 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 23:26:38,271 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/parallel-misc-2.wvr.c[2554,2567] [2024-04-04 23:26:38,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 23:26:38,278 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 23:26:38,278 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 23:26:38,284 INFO L206 MainTranslator]: Completed translation [2024-04-04 23:26:38,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38 WrapperNode [2024-04-04 23:26:38,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 23:26:38,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 23:26:38,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 23:26:38,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 23:26:38,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,345 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-04-04 23:26:38,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 23:26:38,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 23:26:38,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 23:26:38,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 23:26:38,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 23:26:38,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 23:26:38,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 23:26:38,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 23:26:38,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (1/1) ... [2024-04-04 23:26:38,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 23:26:38,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 23:26:38,403 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-04 23:26:38,412 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-04 23:26:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 23:26:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-04 23:26:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-04 23:26:38,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-04 23:26:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 23:26:38,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 23:26:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 23:26:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 23:26:38,446 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 23:26:38,531 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 23:26:38,533 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 23:26:38,696 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 23:26:38,728 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 23:26:38,729 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-04 23:26:38,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 11:26:38 BoogieIcfgContainer [2024-04-04 23:26:38,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 23:26:38,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 23:26:38,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 23:26:38,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 23:26:38,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 11:26:38" (1/3) ... [2024-04-04 23:26:38,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7261300d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 11:26:38, skipping insertion in model container [2024-04-04 23:26:38,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 11:26:38" (2/3) ... [2024-04-04 23:26:38,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7261300d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 11:26:38, skipping insertion in model container [2024-04-04 23:26:38,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 11:26:38" (3/3) ... [2024-04-04 23:26:38,736 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-04-04 23:26:38,742 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 23:26:38,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 23:26:38,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-04 23:26:38,750 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 23:26:38,787 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-04 23:26:38,819 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 23:26:38,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 23:26:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 23:26:38,848 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-04 23:26:38,883 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-04 23:26:38,913 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 23:26:38,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:38,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 23:26:38,929 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;@45357f31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-04 23:26:38,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-04 23:26:39,067 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-04 23:26:39,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -43132217, now seen corresponding path program 1 times [2024-04-04 23:26:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:26:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699263992] [2024-04-04 23:26:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:26:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:39,320 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-04 23:26:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:26:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699263992] [2024-04-04 23:26:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699263992] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 23:26:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 23:26:39,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 23:26:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761602215] [2024-04-04 23:26:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 23:26:39,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 23:26:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:26:39,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 23:26:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 23:26:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,492 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:26:39,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 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-04 23:26:39,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 23:26:39,516 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-04 23:26:39,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 144041942, now seen corresponding path program 1 times [2024-04-04 23:26:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:26:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836505262] [2024-04-04 23:26:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:26:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:39,854 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-04 23:26:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:26:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836505262] [2024-04-04 23:26:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836505262] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 23:26:39,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 23:26:39,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-04 23:26:39,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301623855] [2024-04-04 23:26:39,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 23:26:39,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-04 23:26:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:26:39,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-04 23:26:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-04 23:26:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,873 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:26:39,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-04 23:26:39,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:39,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 23:26:39,973 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-04 23:26:39,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1836490839, now seen corresponding path program 1 times [2024-04-04 23:26:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:26:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698927298] [2024-04-04 23:26:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:26:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:26:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:26:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698927298] [2024-04-04 23:26:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698927298] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 23:26:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 23:26:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-04 23:26:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596726403] [2024-04-04 23:26:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 23:26:40,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-04 23:26:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:26:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-04 23:26:40,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-04 23:26:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:26:40,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-04 23:26:40,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:40,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:40,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 23:26:40,210 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-04 23:26:40,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash 557190141, now seen corresponding path program 1 times [2024-04-04 23:26:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:26:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277596740] [2024-04-04 23:26:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:26:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-04 23:26:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:26:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277596740] [2024-04-04 23:26:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277596740] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 23:26:40,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 23:26:40,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-04 23:26:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813787472] [2024-04-04 23:26:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 23:26:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-04 23:26:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:26:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-04 23:26:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-04 23:26:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:26:40,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-04 23:26:40,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:40,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:40,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:40,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-04 23:26:40,550 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-04 23:26:40,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:40,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1775207395, now seen corresponding path program 1 times [2024-04-04 23:26:40,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:26:40,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250917138] [2024-04-04 23:26:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:40,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:26:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:26:41,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:26:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250917138] [2024-04-04 23:26:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250917138] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 23:26:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003530629] [2024-04-04 23:26:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:41,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 23:26:41,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 23:26:41,408 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-04 23:26:41,409 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-04 23:26:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:41,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 22 conjunts are in the unsatisfiable core [2024-04-04 23:26:41,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 23:26:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 23:26:41,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 23:26:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 23:26:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003530629] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 23:26:42,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 23:26:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 26 [2024-04-04 23:26:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993948595] [2024-04-04 23:26:42,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 23:26:42,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-04-04 23:26:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:26:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-04-04 23:26:42,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2024-04-04 23:26:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:42,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:26:42,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.153846153846154) internal successors, (186), 26 states have internal predecessors, (186), 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-04 23:26:42,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:42,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:42,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:42,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:42,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-04 23:26:44,386 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-04 23:26:44,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 23:26:44,579 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-04 23:26:44,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:26:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 247218082, now seen corresponding path program 2 times [2024-04-04 23:26:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:26:44,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243088692] [2024-04-04 23:26:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:26:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:26:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:26:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 91 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-04 23:26:45,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:26:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243088692] [2024-04-04 23:26:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243088692] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 23:26:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241729034] [2024-04-04 23:26:45,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 23:26:45,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 23:26:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 23:26:45,537 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-04 23:26:45,552 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-04 23:26:45,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 23:26:45,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 23:26:45,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-04 23:26:45,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 23:26:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:26:47,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 23:26:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:26:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241729034] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 23:26:54,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 23:26:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 25] total 63 [2024-04-04 23:26:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461174487] [2024-04-04 23:26:54,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 23:26:54,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-04-04 23:26:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:26:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-04-04 23:26:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=3353, Unknown=0, NotChecked=0, Total=3906 [2024-04-04 23:26:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:54,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:26:54,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.238095238095238) internal successors, (267), 63 states have internal predecessors, (267), 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-04 23:26:54,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:26:54,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:26:54,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:54,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:26:54,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-04-04 23:26:54,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:27:18,168 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 108 DAG size of output: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:27:20,176 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-04 23:27:22,193 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-04 23:27:24,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 23:27:26,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 23:27:28,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:27:30,721 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-04 23:27:32,736 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-04 23:27:55,671 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 81 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:28:08,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:28:10,519 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-04 23:28:12,903 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-04 23:28:35,770 WARN L293 SmtUtils]: Spent 16.85s on a formula simplification. DAG size of input: 103 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:28:49,731 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 81 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:29:13,069 WARN L293 SmtUtils]: Spent 11.68s on a formula simplification. DAG size of input: 91 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:29:32,516 WARN L293 SmtUtils]: Spent 11.16s on a formula simplification. DAG size of input: 87 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:30:04,859 WARN L293 SmtUtils]: Spent 23.77s on a formula simplification. DAG size of input: 113 DAG size of output: 99 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:30:45,442 WARN L293 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 79 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:30:58,517 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 91 DAG size of output: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:31:01,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-04 23:31:02,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 23:32:26,144 WARN L293 SmtUtils]: Spent 25.88s on a formula simplification. DAG size of input: 81 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:32:46,254 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 96 DAG size of output: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:33:24,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:33:30,431 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-04 23:33:35,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:33:44,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~N~0 2)) (.cse3 (* 4294967296 (div c_~i1~0 4294967296))) (.cse5 (* (div c_~N~0 2147483648) 4294967296))) (let ((.cse6 (* (mod c_~N~0 2147483648) 2)) (.cse0 (+ c_~i1~0 .cse5)) (.cse4 (< (+ .cse1 .cse3) (+ c_~i1~0 .cse5 1))) (.cse2 (* (- 1) c_~i2~0))) (and (or (< .cse0 (+ 2 (* (div (+ .cse1 (- 3) .cse2) 4294967296) 4294967296) c_~i2~0 .cse3)) .cse4) (< (+ .cse5 c_~i2~0 1) (+ .cse1 (* (div c_~i2~0 4294967296) 4294967296))) (or (< .cse6 (+ (mod (+ c_~i1~0 2) 4294967296) 1)) (< .cse6 (+ (mod (+ c_~i1~0 1) 4294967296) 1)) (< .cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 2) 4294967296) 1)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 3) 4294967296) .cse6)) (or (< (mod (+ 2 c_~i2~0) 4294967296) .cse6) (< .cse6 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 2) 4294967296) 1)) (< .cse6 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 1) 4294967296) 1)) (< .cse6 (+ 1 (mod (+ c_~i2~0 1) 4294967296)))) (or (< .cse0 (+ |c_thread2Thread1of1ForFork1_#t~post4| (* 4294967296 (div (+ .cse1 (- 3) (* |c_thread2Thread1of1ForFork1_#t~post4| (- 1))) 4294967296)) 2 .cse3)) .cse4) (<= (* (div (+ c_~i1~0 4294967295 .cse2) 4294967296) 4294967296) (+ c_~i1~0 (* (div .cse2 2) 2)))))) is different from false [2024-04-04 23:33:52,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:33:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:33:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:33:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:33:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:33:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-04-04 23:33:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-04-04 23:33:53,913 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-04 23:33:54,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 23:33:54,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 23:33:54,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 23:33:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash 259527957, now seen corresponding path program 3 times [2024-04-04 23:33:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 23:33:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380457267] [2024-04-04 23:33:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 23:33:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 23:33:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 23:33:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 55 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:33:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 23:33:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380457267] [2024-04-04 23:33:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380457267] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 23:33:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019469214] [2024-04-04 23:33:55,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-04 23:33:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 23:33:55,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 23:33:55,987 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-04 23:33:55,989 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-04 23:33:58,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-04 23:33:58,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 23:33:58,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2024-04-04 23:33:58,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 23:33:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 53 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:33:59,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 23:34:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 53 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 23:34:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019469214] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 23:34:06,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 23:34:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 78 [2024-04-04 23:34:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334586497] [2024-04-04 23:34:06,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 23:34:06,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-04-04 23:34:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 23:34:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-04-04 23:34:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=5451, Unknown=0, NotChecked=0, Total=6006 [2024-04-04 23:34:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:34:06,495 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 23:34:06,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 4.256410256410256) internal successors, (332), 78 states have internal predecessors, (332), 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-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-04-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-04-04 23:34:06,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 23:35:40,476 WARN L293 SmtUtils]: Spent 41.30s on a formula simplification. DAG size of input: 105 DAG size of output: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:35:41,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:35:45,561 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-04 23:35:47,566 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-04 23:35:50,220 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-04 23:35:54,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:35:56,999 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-04 23:35:59,005 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-04 23:36:01,038 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-04 23:36:03,614 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-04 23:36:45,416 WARN L293 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 75 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:36:47,419 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-04 23:36:50,168 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-04 23:36:53,366 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-04 23:36:54,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:36:57,470 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-04 23:36:58,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:37:00,987 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-04 23:37:03,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 23:37:06,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 23:37:08,879 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-04 23:37:10,885 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-04 23:37:13,616 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-04 23:37:18,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 23:38:50,321 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 109 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:38:52,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (mod c_~i1~0 4294967296)) (.cse7 (* (mod c_~N~0 2147483648) 2))) (let ((.cse2 (+ 1 (mod (+ c_~i2~0 1) 4294967296))) (.cse6 (+ (mod c_~i2~0 4294967296) 1)) (.cse14 (+ (mod (+ 8 c_~i2~0) 4294967296) 1)) (.cse8 (+ (mod (+ 2 c_~i2~0) 4294967296) 1)) (.cse16 (* (div (mod (+ c_~i1~0 2) 4294967296) 2) 2)) (.cse13 (+ (mod (+ 5 c_~i2~0) 4294967296) 1)) (.cse9 (< .cse21 .cse7)) (.cse18 (+ (mod (+ 6 c_~i2~0) 4294967296) 1)) (.cse5 (+ (mod (+ 3 c_~i2~0) 4294967296) 1)) (.cse11 (+ (mod (+ 7 c_~i2~0) 4294967296) 1)) (.cse17 (* (div (mod (+ c_~i1~0 4) 4294967296) 2) 2)) (.cse1 (+ (mod (+ c_~i2~0 4) 4294967296) 1))) (and (let ((.cse0 (* (div (mod (+ c_~i1~0 1) 4294967296) 2) 2))) (or (< .cse0 .cse1) (< .cse0 .cse2))) (let ((.cse3 (* (div (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 2) 4294967296) 2) 2))) (or (< .cse3 .cse1) (< .cse3 .cse2))) (let ((.cse4 (* (div (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 1) 4294967296) 2) 2))) (or (< .cse4 .cse5) (< .cse4 .cse6))) (or (< .cse7 .cse8) .cse9) (let ((.cse10 (* (div (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 5) 4294967296) 2) 2))) (or (< .cse10 .cse11) (< .cse10 .cse1))) (let ((.cse12 (* 2 (div (mod (+ c_~i1~0 6) 4294967296) 2)))) (or (< .cse12 .cse13) (< .cse12 .cse14))) (let ((.cse15 (* 2 (div (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 3) 4294967296) 2)))) (or (< .cse15 .cse13) (< .cse15 .cse8))) (or (< .cse16 .cse1) (< .cse16 .cse2)) (or (< .cse17 .cse18) (< .cse17 .cse5)) (let ((.cse19 (* (div (mod (+ c_~i1~0 5) 4294967296) 2) 2))) (or (< .cse19 .cse14) (< .cse19 .cse13))) (let ((.cse20 (* (div .cse21 2) 2))) (or (< .cse20 .cse6) (< .cse20 .cse5))) (let ((.cse22 (* 2 (div (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 6) 4294967296) 2)))) (or (< .cse22 .cse14) (< .cse22 .cse13))) (or (< .cse16 .cse8) (< .cse16 .cse13)) (or (< .cse7 .cse5) .cse9) (let ((.cse23 (* 2 (div (mod (+ c_~i1~0 3) 4294967296) 2)))) (or (< .cse23 .cse18) (< .cse23 .cse5))) (let ((.cse24 (* 2 (div (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4) 4294967296) 2)))) (or (< .cse24 .cse18) (< .cse24 .cse5))) (or (< .cse17 .cse11) (< .cse17 .cse1))))) is different from false [2024-04-04 23:40:17,832 WARN L293 SmtUtils]: Spent 23.54s on a formula simplification. DAG size of input: 149 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 23:40:19,838 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (mod (+ 5 c_~i2~0) 4294967296) 1)) (.cse5 (+ (mod (+ 3 c_~i2~0) 4294967296) 1)) (.cse1 (+ (mod (+ c_~i2~0 4) 4294967296) 1))) (and (let ((.cse0 (* (div (mod (+ c_~i1~0 1) 4294967296) 2) 2))) (or (< .cse0 .cse1) (< .cse0 (+ 1 (mod (+ c_~i2~0 1) 4294967296))))) (let ((.cse2 (* (div (mod (+ c_~i1~0 5) 4294967296) 2) 2))) (or (< .cse2 (+ (mod (+ 8 c_~i2~0) 4294967296) 1)) (< .cse2 .cse3))) (let ((.cse4 (* (div (mod c_~i1~0 4294967296) 2) 2))) (or (< .cse4 (+ (mod c_~i2~0 4294967296) 1)) (< .cse4 .cse5))) (let ((.cse6 (* (div (mod (+ c_~i1~0 2) 4294967296) 2) 2))) (or (< .cse6 (+ (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse6 .cse3))) (let ((.cse7 (* 2 (div (mod (+ c_~i1~0 3) 4294967296) 2)))) (or (< .cse7 (+ (mod (+ 6 c_~i2~0) 4294967296) 1)) (< .cse7 .cse5))) (let ((.cse8 (* (div (mod (+ c_~i1~0 4) 4294967296) 2) 2))) (or (< .cse8 (+ (mod (+ 7 c_~i2~0) 4294967296) 1)) (< .cse8 .cse1))))) is different from false Received shutdown request... [2024-04-04 23:41:13,361 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-04 23:41:13,376 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-04 23:41:13,376 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-04 23:41:13,543 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-04 23:41:13,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 23:41:13,737 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-5-2-1 context. [2024-04-04 23:41:13,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-04 23:41:13,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-04 23:41:13,740 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-04 23:41:13,743 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-04-04 23:41:13,745 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-04 23:41:13,745 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-04 23:41:13,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 11:41:13 BasicIcfg [2024-04-04 23:41:13,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-04 23:41:13,748 INFO L158 Benchmark]: Toolchain (without parser) took 875691.04ms. Allocated memory was 369.1MB in the beginning and 595.6MB in the end (delta: 226.5MB). Free memory was 300.6MB in the beginning and 483.2MB in the end (delta: -182.6MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2024-04-04 23:41:13,748 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 23:41:13,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.34ms. Allocated memory is still 369.1MB. Free memory was 300.4MB in the beginning and 289.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-04 23:41:13,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.51ms. Allocated memory is still 369.1MB. Free memory was 289.1MB in the beginning and 339.9MB in the end (delta: -50.8MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. [2024-04-04 23:41:13,749 INFO L158 Benchmark]: Boogie Preprocessor took 25.68ms. Allocated memory is still 369.1MB. Free memory was 339.9MB in the beginning and 338.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-04 23:41:13,749 INFO L158 Benchmark]: RCFGBuilder took 357.81ms. Allocated memory is still 369.1MB. Free memory was 338.8MB in the beginning and 323.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-04-04 23:41:13,749 INFO L158 Benchmark]: TraceAbstraction took 875015.76ms. Allocated memory was 369.1MB in the beginning and 595.6MB in the end (delta: 226.5MB). Free memory was 322.6MB in the beginning and 483.2MB in the end (delta: -160.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2024-04-04 23:41:13,750 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.34ms. Allocated memory is still 369.1MB. Free memory was 300.4MB in the beginning and 289.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.51ms. Allocated memory is still 369.1MB. Free memory was 289.1MB in the beginning and 339.9MB in the end (delta: -50.8MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.68ms. Allocated memory is still 369.1MB. Free memory was 339.9MB in the beginning and 338.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 357.81ms. Allocated memory is still 369.1MB. Free memory was 338.8MB in the beginning and 323.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 875015.76ms. Allocated memory was 369.1MB in the beginning and 595.6MB in the end (delta: 226.5MB). Free memory was 322.6MB in the beginning and 483.2MB in the end (delta: -160.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4251, independent: 3236, independent conditional: 3141, independent unconditional: 95, dependent: 1015, dependent conditional: 979, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3236, independent: 3236, independent conditional: 3141, independent unconditional: 95, 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: 3236, independent: 3236, independent conditional: 3141, independent unconditional: 95, 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: 3236, independent: 3236, independent conditional: 3141, independent unconditional: 95, 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: 3236, independent: 3236, independent conditional: 753, independent unconditional: 2483, 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: 3236, independent: 3236, independent conditional: 701, independent unconditional: 2535, 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: 3236, independent: 3236, independent conditional: 701, independent unconditional: 2535, 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: 387, independent: 387, independent conditional: 36, independent unconditional: 351, 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: 387, independent: 381, independent conditional: 0, independent unconditional: 381, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3236, independent: 2849, independent conditional: 665, independent unconditional: 2184, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 387, unknown conditional: 36, unknown unconditional: 351] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 387, Positive conditional cache size: 36, Positive unconditional cache size: 351, 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: 52, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3236, independent: 3236, independent conditional: 753, independent unconditional: 2483, 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: 3236, independent: 3236, independent conditional: 701, independent unconditional: 2535, 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: 3236, independent: 3236, independent conditional: 701, independent unconditional: 2535, 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: 387, independent: 387, independent conditional: 36, independent unconditional: 351, 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: 387, independent: 381, independent conditional: 0, independent unconditional: 381, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3236, independent: 2849, independent conditional: 665, independent unconditional: 2184, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 387, unknown conditional: 36, unknown unconditional: 351] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 387, Positive conditional cache size: 36, Positive unconditional cache size: 351, 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: 52 ], Independence queries for same thread: 1015 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-5-2-1 context. - TimeoutResultAtElement [Line: 94]: 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 ∧-6-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-5-2-1 context. - TimeoutResultAtElement [Line: 93]: 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 ∧-6-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-5-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 123 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 874.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 849.2s, 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: 290, 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, 2.8s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 1209 NumberOfCodeBlocks, 1209 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1619 ConstructedInterpolants, 0 QuantifiedInterpolants, 21255 SizeOfPredicates, 72 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 294/1575 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