/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 09:53:56,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 09:53:56,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 09:53:56,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 09:53:56,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 09:53:56,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 09:53:56,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 09:53:56,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 09:53:56,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 09:53:56,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 09:53:56,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 09:53:56,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 09:53:56,262 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 09:53:56,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 09:53:56,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 09:53:56,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 09:53:56,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 09:53:56,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 09:53:56,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 09:53:56,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 09:53:56,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 09:53:56,266 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 09:53:56,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 09:53:56,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 09:53:56,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 09:53:56,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 09:53:56,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 09:53:56,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 09:53:56,267 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 09:53:56,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 09:53:56,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 09:53:56,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 09:53:56,268 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 09:53:56,268 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-06 09:53:56,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 09:53:56,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 09:53:56,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 09:53:56,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-06 09:53:56,478 INFO L274 PluginConnector]: CDTParser initialized [2024-04-06 09:53:56,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-04-06 09:53:57,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-06 09:53:57,598 INFO L384 CDTParser]: Found 1 translation units. [2024-04-06 09:53:57,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-04-06 09:53:57,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bb9ded13c/34c13937a4cb4b118c6badc45c9d600b/FLAG88ae1db38 [2024-04-06 09:53:57,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bb9ded13c/34c13937a4cb4b118c6badc45c9d600b [2024-04-06 09:53:57,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 09:53:57,622 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-06 09:53:57,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-06 09:53:57,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-06 09:53:57,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-06 09:53:57,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3cb147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57, skipping insertion in model container [2024-04-06 09:53:57,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,643 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-06 09:53:57,749 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-04-06 09:53:57,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 09:53:57,759 INFO L202 MainTranslator]: Completed pre-run [2024-04-06 09:53:57,772 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-04-06 09:53:57,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 09:53:57,778 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 09:53:57,778 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 09:53:57,783 INFO L206 MainTranslator]: Completed translation [2024-04-06 09:53:57,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57 WrapperNode [2024-04-06 09:53:57,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-06 09:53:57,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 09:53:57,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 09:53:57,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 09:53:57,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,814 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-04-06 09:53:57,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 09:53:57,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 09:53:57,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 09:53:57,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 09:53:57,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 09:53:57,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 09:53:57,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 09:53:57,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 09:53:57,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (1/1) ... [2024-04-06 09:53:57,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 09:53:57,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:53:57,861 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-06 09:53:57,879 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-06 09:53:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-06 09:53:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 09:53:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 09:53:57,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 09:53:57,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-06 09:53:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-06 09:53:57,898 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 09:53:57,993 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 09:53:57,994 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 09:53:58,135 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 09:53:58,162 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 09:53:58,162 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-06 09:53:58,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:53:58 BoogieIcfgContainer [2024-04-06 09:53:58,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 09:53:58,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 09:53:58,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 09:53:58,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 09:53:58,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:53:57" (1/3) ... [2024-04-06 09:53:58,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3e62d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:53:58, skipping insertion in model container [2024-04-06 09:53:58,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:53:57" (2/3) ... [2024-04-06 09:53:58,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3e62d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:53:58, skipping insertion in model container [2024-04-06 09:53:58,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:53:58" (3/3) ... [2024-04-06 09:53:58,169 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2024-04-06 09:53:58,174 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 09:53:58,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 09:53:58,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 09:53:58,181 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 09:53:58,221 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-06 09:53:58,252 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 09:53:58,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 09:53:58,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:53:58,255 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-06 09:53:58,262 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-06 09:53:58,283 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 09:53:58,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:53:58,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 09:53:58,301 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;@3fb468e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-06 09:53:58,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-06 09:53:58,419 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-06 09:53:58,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:53:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1170405292, now seen corresponding path program 1 times [2024-04-06 09:53:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:53:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544652449] [2024-04-06 09:53:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:53:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:53:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:53:58,627 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-06 09:53:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:53:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544652449] [2024-04-06 09:53:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544652449] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 09:53:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 09:53:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-06 09:53:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785942351] [2024-04-06 09:53:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 09:53:58,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-06 09:53:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:53:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-06 09:53:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-06 09:53:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:58,710 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:53:58,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 09:53:58,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:58,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-06 09:53:58,777 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-06 09:53:58,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:53:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2044128722, now seen corresponding path program 1 times [2024-04-06 09:53:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:53:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52002847] [2024-04-06 09:53:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:53:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:53:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:53:59,095 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-06 09:53:59,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:53:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52002847] [2024-04-06 09:53:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52002847] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 09:53:59,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 09:53:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-06 09:53:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703866344] [2024-04-06 09:53:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 09:53:59,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-06 09:53:59,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:53:59,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-06 09:53:59,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-04-06 09:53:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:59,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:53:59,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 09:53:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:59,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:53:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-06 09:53:59,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-06 09:53:59,209 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-06 09:53:59,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:53:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 849842810, now seen corresponding path program 1 times [2024-04-06 09:53:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:53:59,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101410473] [2024-04-06 09:53:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:53:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:53:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:53:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:53:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:53:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101410473] [2024-04-06 09:53:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101410473] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 09:53:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562681173] [2024-04-06 09:53:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:53:59,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 09:53:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:53:59,710 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-06 09:53:59,711 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-06 09:53:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:53:59,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 09:53:59,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 09:53:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:53:59,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 09:54:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:54:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562681173] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 09:54:00,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 09:54:00,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-04-06 09:54:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892408437] [2024-04-06 09:54:00,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 09:54:00,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-04-06 09:54:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:54:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-04-06 09:54:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-04-06 09:54:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:00,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:54:00,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 09:54:00,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:00,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-06 09:54:00,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-06 09:54:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-06 09:54:01,054 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-06 09:54:01,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-04-06 09:54:01,248 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-06 09:54:01,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:54:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash -470519814, now seen corresponding path program 2 times [2024-04-06 09:54:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:54:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192100006] [2024-04-06 09:54:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:54:01,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:54:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:54:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:54:02,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:54:02,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192100006] [2024-04-06 09:54:02,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192100006] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 09:54:02,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099170403] [2024-04-06 09:54:02,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 09:54:02,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 09:54:02,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:54:02,136 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-06 09:54:02,159 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-06 09:54:02,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 09:54:02,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 09:54:02,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 30 conjunts are in the unsatisfiable core [2024-04-06 09:54:02,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 09:54:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:54:03,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 09:54:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:54:07,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099170403] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 09:54:07,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 09:54:07,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 20] total 52 [2024-04-06 09:54:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694336621] [2024-04-06 09:54:07,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 09:54:07,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-06 09:54:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:54:07,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-06 09:54:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2224, Unknown=0, NotChecked=0, Total=2652 [2024-04-06 09:54:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:07,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:54:07,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 09:54:07,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:07,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-06 09:54:07,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-06 09:54:07,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:54:38,140 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-06 09:54:40,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-06 09:54:44,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-06 09:54:46,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:54:48,606 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-06 09:54:53,291 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-06 09:55:15,441 WARN L293 SmtUtils]: Spent 11.79s on a formula simplification. DAG size of input: 103 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 09:55:28,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:55:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:55:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-06 09:55:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-04-06 09:55:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-04-06 09:55:38,880 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-06 09:55:39,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 09:55:39,077 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-06 09:55:39,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:55:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash 884804186, now seen corresponding path program 3 times [2024-04-06 09:55:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:55:39,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592897610] [2024-04-06 09:55:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:55:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:55:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:55:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 46 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:55:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:55:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592897610] [2024-04-06 09:55:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592897610] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 09:55:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795847371] [2024-04-06 09:55:43,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-06 09:55:43,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 09:55:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:55:43,405 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-06 09:55:43,407 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-06 09:55:44,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-04-06 09:55:44,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 09:55:44,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 62 conjunts are in the unsatisfiable core [2024-04-06 09:55:44,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 09:56:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 88 proven. 189 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-04-06 09:56:13,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 09:58:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 88 proven. 183 refuted. 6 times theorem prover too weak. 7 trivial. 0 not checked. [2024-04-06 09:58:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795847371] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 09:58:21,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 09:58:21,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 104 [2024-04-06 09:58:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744338277] [2024-04-06 09:58:21,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 09:58:21,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-04-06 09:58:21,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:58:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-04-06 09:58:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1530, Invalid=9170, Unknown=12, NotChecked=0, Total=10712 [2024-04-06 09:58:21,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:58:21,143 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:58:21,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.5288461538461537) internal successors, (263), 104 states have internal predecessors, (263), 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-06 09:58:21,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:58:21,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-06 09:58:21,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-04-06 09:58:21,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-04-06 09:58:21,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:58:56,261 WARN L293 SmtUtils]: Spent 20.62s on a formula simplification. DAG size of input: 164 DAG size of output: 139 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 09:58:58,651 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-06 09:59:01,503 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-06 09:59:03,570 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-06 09:59:04,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:59:06,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:59:08,098 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-06 09:59:10,397 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-06 09:59:11,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:59:13,764 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-06 09:59:34,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse67 (mod c_~M~0 4294967296))) (let ((.cse85 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse87 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse76 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296)) (.cse21 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse24 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse20 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse22 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse89 (* (- 1) c_thread2Thread1of1ForFork1_~i~1)) (.cse93 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse80 (mod (+ c_~C~0 c_~counter~0) 4294967296)) (.cse95 (mod c_~counter~0 4294967296)) (.cse17 (+ c_thread2Thread1of1ForFork1_~i~1 3)) (.cse91 (+ c_thread2Thread1of1ForFork1_~i~1 4)) (.cse97 (+ 2 c_thread2Thread1of1ForFork1_~i~1)) (.cse88 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse96 (* (- 1) .cse67))) (let ((.cse77 (< (+ 4294967294 (* (div (+ .cse96 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse78 (mod c_~C~0 4294967296)) (.cse79 (< (+ .cse67 (* (div c_thread2Thread1of1ForFork1_~i~1 4294967296) 4294967296)) .cse88)) (.cse68 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse51 (< (+ 4294967293 (* (div (+ .cse96 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse52 (< (+ .cse67 (* (div .cse88 4294967296) 4294967296)) .cse97)) (.cse74 (< (+ 4294967291 (* (div (+ .cse96 c_thread2Thread1of1ForFork1_~i~1 4) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse75 (< (+ .cse67 (* 4294967296 (div .cse17 4294967296))) .cse91)) (.cse6 (< .cse95 1)) (.cse53 (< (+ .cse67 (* 4294967296 (div .cse97 4294967296))) .cse17)) (.cse54 (< (+ 4294967292 (* (div (+ .cse96 c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse10 (< 0 .cse95)) (.cse11 (< .cse80 1)) (.cse18 (+ .cse93 1)) (.cse14 (let ((.cse94 (+ 7 c_thread2Thread1of1ForFork1_~i~1))) (+ (* (div .cse94 4294967296) 4294967296) (* (div (+ .cse89 8589934584) 4294967296) 4294967296) (mod .cse94 4294967296)))) (.cse84 (+ 4294967297 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse83 (+ .cse22 4294967297)) (.cse61 (+ .cse20 4294967297)) (.cse82 (+ 4294967297 .cse93)) (.cse31 (+ 4294967297 .cse24)) (.cse30 (let ((.cse92 (+ c_thread2Thread1of1ForFork1_~i~1 6))) (+ (* (div .cse92 4294967296) 4294967296) (mod .cse92 4294967296) (* (div (+ .cse89 8589934585) 4294967296) 4294967296)))) (.cse15 (+ 4294967297 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 6) 4294967296))) (.cse81 (+ (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 4294967297)) (.cse7 (+ (* (div (+ .cse89 8589934587) 4294967296) 4294967296) (* (div .cse91 4294967296) 4294967296) (mod .cse91 4294967296))) (.cse64 (+ 4294967297 .cse21)) (.cse8 (+ 4294967297 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 5) 4294967296))) (.cse13 (+ .cse76 4294967297)) (.cse12 (+ .cse87 4294967297)) (.cse1 (let ((.cse90 (+ 5 c_thread2Thread1of1ForFork1_~i~1))) (+ (* (div (+ 8589934586 .cse89) 4294967296) 4294967296) (mod .cse90 4294967296) (* 4294967296 (div .cse90 4294967296))))) (.cse9 (+ .cse85 4294967297)) (.cse86 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296))) (let ((.cse2 (+ 4294967297 .cse86)) (.cse0 (< .cse1 .cse9)) (.cse3 (< .cse1 .cse12)) (.cse4 (< .cse1 .cse13)) (.cse5 (< .cse1 .cse8)) (.cse56 (< .cse7 .cse64)) (.cse55 (< .cse1 .cse81)) (.cse39 (< .cse30 .cse15)) (.cse16 (+ (mod (+ 7 |c_thread1Thread1of1ForFork0_#t~post1|) 4294967296) 4294967297)) (.cse40 (< .cse30 .cse13)) (.cse41 (< .cse30 .cse12)) (.cse42 (< .cse30 .cse8)) (.cse25 (< .cse1 .cse31)) (.cse26 (< .cse1 .cse82)) (.cse27 (< .cse1 .cse61)) (.cse28 (< .cse1 .cse83)) (.cse29 (< .cse1 .cse84)) (.cse43 (< .cse7 .cse31)) (.cse44 (< .cse7 .cse61)) (.cse45 (< .cse7 .cse84)) (.cse46 (< .cse7 .cse82)) (.cse47 (< .cse7 .cse83)) (.cse59 (< .cse14 .cse82)) (.cse60 (< .cse14 .cse81)) (.cse62 (< .cse14 .cse84)) (.cse63 (< .cse14 .cse83)) (.cse66 (+ 4294967297 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse69 (< (mod .cse88 4294967296) .cse67)) (.cse19 (< (mod (+ c_~counter~0 (* c_~C~0 2)) 4294967296) 1)) (.cse73 (< .cse67 .cse18)) (.cse58 (< .cse67 (+ .cse87 1))) (.cse37 (< .cse67 (+ .cse86 1))) (.cse38 (< .cse67 (+ .cse85 1))) (.cse72 (and (or .cse74 .cse75 .cse6) (or .cse53 .cse54 .cse10 .cse11))) (.cse32 (< .cse30 .cse84)) (.cse33 (< .cse30 .cse83)) (.cse34 (< .cse30 .cse82)) (.cse65 (< .cse30 .cse81)) (.cse35 (< .cse30 .cse61)) (.cse48 (< .cse67 (+ .cse22 1))) (.cse57 (and (or .cse53 .cse54 .cse6) (or .cse51 .cse10 .cse11 .cse52))) (.cse70 (< .cse68 .cse67)) (.cse71 (< .cse67 (+ .cse21 1))) (.cse23 (< 0 .cse80)) (.cse49 (< .cse67 (+ .cse20 1))) (.cse36 (and (or .cse77 .cse10 (< (+ (* 4294967296 (div (+ (- 1) c_~counter~0 .cse78) 4294967296)) 4294967295) (+ c_~counter~0 .cse78)) .cse79) (or .cse51 .cse6 .cse52))) (.cse50 (< .cse67 (+ .cse24 1)))) (and (or .cse0 (< .cse1 .cse2) .cse3 .cse4 .cse5 .cse6) (or (< .cse7 .cse8) (< .cse7 .cse9) .cse10 (< .cse7 .cse2) .cse11 (< .cse7 .cse12) (< .cse7 .cse13)) (or (< .cse14 .cse15) (< .cse14 .cse13) .cse6 (< .cse14 .cse8) (< .cse14 .cse12) (< .cse14 .cse16)) (or (< (mod .cse17 4294967296) .cse18) .cse19 (< 4294967294 .cse20) (< 4294967294 .cse21) (< 4294967294 .cse22) .cse23 (< 4294967294 .cse24)) (or .cse25 .cse10 .cse26 .cse27 .cse11 .cse28 .cse29) (or (< .cse30 .cse31) .cse6 .cse32 .cse33 .cse34 .cse35) (or .cse25 .cse26 .cse27 .cse6 .cse28 .cse29) (or .cse36 .cse37 .cse38) (or .cse39 (< .cse30 .cse9) .cse6 .cse40 .cse41 .cse42) (or .cse43 .cse19 .cse44 .cse23 .cse45 .cse46 .cse47) (or .cse48 .cse49 .cse50 (and (or .cse19 .cse51 .cse23 .cse52) (or .cse53 .cse54 .cse11))) (or .cse10 .cse26 .cse27 .cse11 .cse55 .cse28 .cse29) (or .cse43 .cse10 .cse44 .cse11 .cse46 .cse47 .cse56) (or .cse57 .cse58 .cse37 .cse38) (or .cse0 .cse10 .cse3 .cse4 .cse11 .cse5 (< .cse1 .cse15)) (or .cse59 .cse60 .cse6 (< .cse14 .cse61) .cse62 .cse63) (or .cse25 (< .cse1 .cse64) .cse26 .cse27 .cse6 .cse28) (or .cse43 .cse44 .cse11 .cse46 .cse47 .cse56) (or .cse19 .cse26 .cse27 .cse23 .cse55 .cse28 .cse29) (or .cse39 (< .cse30 .cse16) .cse10 .cse11 .cse40 .cse41 .cse42) (or .cse25 .cse26 .cse27 .cse11 .cse28 .cse29) (or .cse43 .cse10 .cse44 .cse11 .cse45 .cse46 .cse47) (or .cse10 .cse11 .cse32 .cse33 .cse34 .cse65 .cse35) (or .cse6 .cse32 .cse33 .cse34 .cse65 .cse35) (or (< .cse14 .cse66) .cse59 .cse60 .cse6 .cse62 .cse63) (or (< .cse67 (+ .cse68 1)) .cse69 .cse50 .cse11) (or .cse10 (< .cse30 .cse66) .cse11 .cse32 .cse33 .cse34 .cse65) (= c_~counter~0 0) (or (and (or .cse69 .cse6) (or .cse10 .cse70)) .cse71) (or .cse48 .cse72 .cse49 .cse50 .cse73) (or .cse48 .cse49 .cse50 (and (or .cse53 .cse19 .cse54 .cse23) (or .cse74 .cse75 .cse11)) .cse73) (or .cse72 (< .cse67 (+ .cse76 1)) .cse58 .cse37 .cse38) (or .cse48 .cse72 .cse49 .cse50 .cse71) (or .cse11 .cse32 .cse33 .cse34 .cse65 .cse35) (or .cse49 .cse57 .cse50 .cse71) (or .cse48 .cse49 .cse57 .cse50) (or .cse71 .cse70) (or .cse36 .cse50 .cse71) (or .cse49 .cse50 (and (or .cse51 .cse11 .cse52) (or .cse77 (< (+ 4294967295 (* (div (+ (- 1) c_~C~0 c_~counter~0 .cse78) 4294967296) 4294967296)) (+ c_~C~0 c_~counter~0 .cse78)) .cse23 .cse79))) (or .cse49 .cse36 .cse50)))))) is different from false [2024-04-06 09:59:52,522 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-06 10:00:11,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:00:35,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:00:38,877 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-06 10:00:40,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:00:44,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:00:46,967 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-06 10:00:49,091 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-06 10:00:51,096 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-06 10:01:25,658 WARN L293 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 358 DAG size of output: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:01:39,000 WARN L293 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 276 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-04-06 10:08:33,454 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-06 10:08:33,454 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-06 10:08:33,454 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-06 10:08:34,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-06 10:08:34,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-06 10:08:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-06 10:08:34,517 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2024-04-06 10:08:34,519 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-06 10:08:34,519 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-06 10:08:34,519 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-06 10:08:34,522 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-04-06 10:08:34,524 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-06 10:08:34,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-06 10:08:34,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:08:34 BasicIcfg [2024-04-06 10:08:34,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-06 10:08:34,526 INFO L158 Benchmark]: Toolchain (without parser) took 876904.71ms. Allocated memory was 285.2MB in the beginning and 537.9MB in the end (delta: 252.7MB). Free memory was 216.3MB in the beginning and 345.3MB in the end (delta: -129.1MB). Peak memory consumption was 293.9MB. Max. memory is 8.0GB. [2024-04-06 10:08:34,526 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 10:08:34,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.56ms. Allocated memory is still 285.2MB. Free memory was 215.9MB in the beginning and 205.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-06 10:08:34,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.83ms. Allocated memory is still 285.2MB. Free memory was 205.0MB in the beginning and 203.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-06 10:08:34,527 INFO L158 Benchmark]: Boogie Preprocessor took 17.24ms. Allocated memory is still 285.2MB. Free memory was 203.3MB in the beginning and 202.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 10:08:34,527 INFO L158 Benchmark]: RCFGBuilder took 330.47ms. Allocated memory is still 285.2MB. Free memory was 202.1MB in the beginning and 248.6MB in the end (delta: -46.5MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2024-04-06 10:08:34,527 INFO L158 Benchmark]: TraceAbstraction took 876361.27ms. Allocated memory was 285.2MB in the beginning and 537.9MB in the end (delta: 252.7MB). Free memory was 247.5MB in the beginning and 345.3MB in the end (delta: -97.8MB). Peak memory consumption was 323.7MB. Max. memory is 8.0GB. [2024-04-06 10:08:34,528 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2024-04-06 10:08:34,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.56ms. Allocated memory is still 285.2MB. Free memory was 215.9MB in the beginning and 205.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.83ms. Allocated memory is still 285.2MB. Free memory was 205.0MB in the beginning and 203.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.24ms. Allocated memory is still 285.2MB. Free memory was 203.3MB in the beginning and 202.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.47ms. Allocated memory is still 285.2MB. Free memory was 202.1MB in the beginning and 248.6MB in the end (delta: -46.5MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * TraceAbstraction took 876361.27ms. Allocated memory was 285.2MB in the beginning and 537.9MB in the end (delta: 252.7MB). Free memory was 247.5MB in the beginning and 345.3MB in the end (delta: -97.8MB). Peak memory consumption was 323.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3838, independent: 2770, independent conditional: 2537, independent unconditional: 233, dependent: 1068, dependent conditional: 923, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2776, independent: 2770, independent conditional: 2537, independent unconditional: 233, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2776, independent: 2770, independent conditional: 2537, independent unconditional: 233, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2776, independent: 2770, independent conditional: 2537, independent unconditional: 233, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2786, independent: 2770, independent conditional: 887, independent unconditional: 1883, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2786, independent: 2770, independent conditional: 871, independent unconditional: 1899, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2786, independent: 2770, independent conditional: 871, independent unconditional: 1899, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 122, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 122, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2786, independent: 2649, independent conditional: 871, independent unconditional: 1778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 122, unknown conditional: 0, unknown unconditional: 122] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2786, independent: 2770, independent conditional: 887, independent unconditional: 1883, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2786, independent: 2770, independent conditional: 871, independent unconditional: 1899, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2786, independent: 2770, independent conditional: 871, independent unconditional: 1899, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 122, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 122, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2786, independent: 2649, independent conditional: 871, independent unconditional: 1778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 122, unknown conditional: 0, unknown unconditional: 122] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20 ], Independence queries for same thread: 1062 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 96 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 876.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 705.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 199, 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, 1.5s SatisfiabilityAnalysisTime, 168.4s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 956 ConstructedInterpolants, 1 QuantifiedInterpolants, 21137 SizeOfPredicates, 51 NumberOfNonLiveVariables, 561 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 256/1007 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