/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --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/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 21:19:58,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 21:19:58,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 21:19:58,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 21:19:58,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 21:19:58,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 21:19:58,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 21:19:58,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 21:19:58,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 21:19:58,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 21:19:58,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 21:19:58,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 21:19:58,748 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 21:19:58,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 21:19:58,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 21:19:58,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 21:19:58,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 21:19:58,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 21:19:58,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 21:19:58,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 21:19:58,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 21:19:58,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 21:19:58,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 21:19:58,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 21:19:58,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 21:19:58,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 21:19:58,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 21:19:58,752 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 21:19:58,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 21:19:58,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 21:19:58,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 21:19:58,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 21:19:58,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 21:19:58,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 21:19:58,753 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 21:19:58,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 21:19:58,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 21:19:58,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 21:19:58,754 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 21:19:58,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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-05 21:19:58,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 21:19:58,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 21:19:58,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 21:19:58,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 21:19:58,995 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 21:19:58,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-04-05 21:20:00,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 21:20:00,229 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 21:20:00,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-04-05 21:20:00,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/53545e1dd/8da0f4b026ae4f3fb8b70c5f60b34549/FLAGeac32bcee [2024-04-05 21:20:00,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/53545e1dd/8da0f4b026ae4f3fb8b70c5f60b34549 [2024-04-05 21:20:00,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 21:20:00,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 21:20:00,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 21:20:00,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 21:20:00,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 21:20:00,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2760b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00, skipping insertion in model container [2024-04-05 21:20:00,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,322 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 21:20:00,477 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/test-hard1.wvr.c[3373,3386] [2024-04-05 21:20:00,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 21:20:00,494 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 21:20:00,530 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/test-hard1.wvr.c[3373,3386] [2024-04-05 21:20:00,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 21:20:00,539 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 21:20:00,539 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 21:20:00,544 INFO L206 MainTranslator]: Completed translation [2024-04-05 21:20:00,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00 WrapperNode [2024-04-05 21:20:00,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 21:20:00,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 21:20:00,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 21:20:00,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 21:20:00,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,588 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-04-05 21:20:00,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 21:20:00,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 21:20:00,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 21:20:00,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 21:20:00,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 21:20:00,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 21:20:00,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 21:20:00,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 21:20:00,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (1/1) ... [2024-04-05 21:20:00,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 21:20:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:20:00,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 21:20:00,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 21:20:00,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 21:20:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 21:20:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 21:20:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 21:20:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 21:20:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-05 21:20:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-05 21:20:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-05 21:20:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-05 21:20:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 21:20:00,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 21:20:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 21:20:00,767 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 21:20:00,859 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 21:20:00,861 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 21:20:01,039 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 21:20:01,093 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 21:20:01,093 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-04-05 21:20:01,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:20:01 BoogieIcfgContainer [2024-04-05 21:20:01,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 21:20:01,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 21:20:01,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 21:20:01,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 21:20:01,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 09:20:00" (1/3) ... [2024-04-05 21:20:01,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5810b5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:20:01, skipping insertion in model container [2024-04-05 21:20:01,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:20:00" (2/3) ... [2024-04-05 21:20:01,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5810b5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:20:01, skipping insertion in model container [2024-04-05 21:20:01,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:20:01" (3/3) ... [2024-04-05 21:20:01,101 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-04-05 21:20:01,107 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 21:20:01,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 21:20:01,115 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 21:20:01,115 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 21:20:01,172 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-05 21:20:01,211 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 21:20:01,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 21:20:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:20:01,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 21:20:01,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 21:20:01,247 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 21:20:01,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:20:01,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 21:20:01,279 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;@34cb06d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 21:20:01,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 21:20:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash 738820654, now seen corresponding path program 1 times [2024-04-05 21:20:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 21:20:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 21:20:02,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 21:20:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 21:20:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1891035693, now seen corresponding path program 1 times [2024-04-05 21:20:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:03,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221441, now seen corresponding path program 2 times [2024-04-05 21:20:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:03,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:04,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 21:20:04,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:20:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-04-05 21:20:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:20:04,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195929133] [2024-04-05 21:20:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:04,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-04-05 21:20:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:20:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195929133] [2024-04-05 21:20:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195929133] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:20:04,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:20:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 21:20:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478798495] [2024-04-05 21:20:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:20:04,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 21:20:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:20:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 21:20:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 21:20:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:20:04,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:20:04,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:20:04,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:20:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1071151874, now seen corresponding path program 1 times [2024-04-05 21:20:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:20:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-05 21:20:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1552454937, now seen corresponding path program 3 times [2024-04-05 21:20:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:11,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1229889010, now seen corresponding path program 1 times [2024-04-05 21:20:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:11,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:20:12,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-04-05 21:20:12,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 21:20:12,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:20:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-04-05 21:20:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:20:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658597925] [2024-04-05 21:20:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-04-05 21:20:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:20:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658597925] [2024-04-05 21:20:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658597925] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:20:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583942425] [2024-04-05 21:20:12,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 21:20:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:20:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:20:12,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:20:12,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 21:20:12,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 21:20:12,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 21:20:12,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-04-05 21:20:12,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:20:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-04-05 21:20:12,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 21:20:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583942425] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:20:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 21:20:12,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-04-05 21:20:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213797075] [2024-04-05 21:20:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:20:12,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-05 21:20:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:20:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-05 21:20:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-04-05 21:20:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:20:12,797 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:20:12,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:20:12,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:20:12,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:20:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1606541925, now seen corresponding path program 1 times [2024-04-05 21:20:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-05 21:20:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-05 21:20:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1102317186, now seen corresponding path program 4 times [2024-04-05 21:20:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:17,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -893485315, now seen corresponding path program 5 times [2024-04-05 21:20:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:17,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:20:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:20:18,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 21:20:18,495 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13 [2024-04-05 21:20:18,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 21:20:18,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:20:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-04-05 21:20:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:20:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715215616] [2024-04-05 21:20:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-04-05 21:20:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:20:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715215616] [2024-04-05 21:20:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715215616] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:20:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036548254] [2024-04-05 21:20:18,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 21:20:18,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:20:18,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:20:18,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:20:18,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 21:20:18,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-05 21:20:18,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 21:20:18,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjunts are in the unsatisfiable core [2024-04-05 21:20:18,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:20:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-04-05 21:20:19,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 21:20:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 183 proven. 11 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-04-05 21:20:19,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036548254] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 21:20:19,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 21:20:19,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 15 [2024-04-05 21:20:19,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988629833] [2024-04-05 21:20:19,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 21:20:19,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-05 21:20:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:20:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-05 21:20:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-04-05 21:20:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:20:19,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:20:19,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:20:19,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:20:19,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:20:19,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:20:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -32557041, now seen corresponding path program 2 times [2024-04-05 21:20:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 47 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 21:20:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 47 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 21:20:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -717409526, now seen corresponding path program 6 times [2024-04-05 21:20:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:22,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1702865209, now seen corresponding path program 3 times [2024-04-05 21:20:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:23,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1749638614, now seen corresponding path program 1 times [2024-04-05 21:20:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 97 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-05 21:20:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 42 proven. 58 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-04-05 21:20:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash -45853831, now seen corresponding path program 7 times [2024-04-05 21:20:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:30,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:20:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:20:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -149624937, now seen corresponding path program 1 times [2024-04-05 21:20:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 109 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 21:20:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 21:20:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1860794478, now seen corresponding path program 1 times [2024-04-05 21:20:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 31 proven. 87 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-04-05 21:20:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 24 proven. 88 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-04-05 21:20:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1431648606, now seen corresponding path program 1 times [2024-04-05 21:20:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:20:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:20:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:20:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:20:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 8 proven. 106 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 21:21:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash 551015747, now seen corresponding path program 8 times [2024-04-05 21:21:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:02,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:21:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1813225361, now seen corresponding path program 1 times [2024-04-05 21:21:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 21:21:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-04-05 21:21:10,722 INFO L85 PathProgramCache]: Analyzing trace with hash -327509116, now seen corresponding path program 9 times [2024-04-05 21:21:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:10,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:21:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2009580638, now seen corresponding path program 4 times [2024-04-05 21:21:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 21:21:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:21:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1403089182, now seen corresponding path program 10 times [2024-04-05 21:21:19,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:19,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:21:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:21:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:21:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 21:21:19,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 21:21:19,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28 [2024-04-05 21:21:19,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 21:21:19,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:21:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -466662140, now seen corresponding path program 4 times [2024-04-05 21:21:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:21:19,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024974386] [2024-04-05 21:21:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-04-05 21:21:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:21:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024974386] [2024-04-05 21:21:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024974386] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 21:21:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 21:21:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-05 21:21:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138036573] [2024-04-05 21:21:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 21:21:20,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-05 21:21:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:21:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-05 21:21:20,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-04-05 21:21:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:21:20,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:21:20,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:21:20,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:21:20,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:21:20,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 21:21:20,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:21:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1531332640, now seen corresponding path program 11 times [2024-04-05 21:21:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:20,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 21:21:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 21:21:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:21:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:21:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 21:21:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 21:21:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,SelfDestructingSolverStorable36 [2024-04-05 21:21:20,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 21:21:20,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:21:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -552899893, now seen corresponding path program 5 times [2024-04-05 21:21:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:21:20,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213817899] [2024-04-05 21:21:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:21:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 114 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:21:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:21:23,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213817899] [2024-04-05 21:21:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213817899] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:21:23,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720121004] [2024-04-05 21:21:23,493 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-05 21:21:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:21:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:21:23,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:21:23,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 21:21:23,675 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-04-05 21:21:23,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 21:21:23,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 21:21:23,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:21:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 42 proven. 231 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 21:21:29,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 21:21:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 21:21:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720121004] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 21:21:32,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 21:21:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 48] total 124 [2024-04-05 21:21:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029515641] [2024-04-05 21:21:32,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 21:21:32,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2024-04-05 21:21:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:21:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2024-04-05 21:21:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3651, Invalid=11601, Unknown=0, NotChecked=0, Total=15252 [2024-04-05 21:21:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:21:32,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:21:32,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 3.3629032258064515) internal successors, (417), 124 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:21:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:21:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:21:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 21:21:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 21:21:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:21:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:21:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:21:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 21:21:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 21:21:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2024-04-05 21:21:56,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 21:21:56,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-04-05 21:21:56,493 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 21:21:56,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 21:21:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2052491913, now seen corresponding path program 6 times [2024-04-05 21:21:56,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 21:21:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554879861] [2024-04-05 21:21:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 21:21:56,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 21:21:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 21:22:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 477 proven. 2415 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 21:22:13,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 21:22:13,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554879861] [2024-04-05 21:22:13,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554879861] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 21:22:13,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896718609] [2024-04-05 21:22:13,991 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-04-05 21:22:13,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 21:22:13,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 21:22:13,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 21:22:13,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-05 21:22:14,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-04-05 21:22:14,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 21:22:14,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 146 conjunts are in the unsatisfiable core [2024-04-05 21:22:14,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 21:26:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 337 proven. 2550 refuted. 27 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-05 21:26:51,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 21:27:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 213 proven. 2712 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 21:27:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896718609] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 21:27:02,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 21:27:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 112, 120] total 314 [2024-04-05 21:27:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142103663] [2024-04-05 21:27:02,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 21:27:02,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 314 states [2024-04-05 21:27:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 21:27:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 314 interpolants. [2024-04-05 21:27:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17028, Invalid=81197, Unknown=57, NotChecked=0, Total=98282 [2024-04-05 21:27:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:27:02,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 21:27:02,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 314 states, 314 states have (on average 2.910828025477707) internal successors, (914), 314 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 21:27:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-04-05 21:27:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 21:27:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-05 21:27:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 21:27:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 305 states. [2024-04-05 21:27:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 21:27:53,566 WARN L293 SmtUtils]: Spent 24.44s on a formula simplification. DAG size of input: 341 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:28:15,271 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 266 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:28:18,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:28:21,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:28:22,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:28:24,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:28:26,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:29:47,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:29:49,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:29:51,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:29:53,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:30:22,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:30:53,232 WARN L293 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 246 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:30:56,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:30:58,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:31:30,280 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 307 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:31:32,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:31:57,954 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 248 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:32:05,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:32:16,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-05 21:32:18,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:32:21,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:32:36,025 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 323 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:32:44,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:32:54,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 21:33:55,578 WARN L293 SmtUtils]: Spent 37.94s on a formula simplification. DAG size of input: 331 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 21:33:58,822 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 [] Received shutdown request... [2024-04-05 21:34:08,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-04-05 21:34:08,683 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 21:34:08,683 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 21:34:08,683 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 21:34:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-04-05 21:34:08,869 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-7-2-4-3-3-2-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. [2024-04-05 21:34:08,870 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-04-05 21:34:08,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-05 21:34:08,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-05 21:34:08,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-05 21:34:08,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-05 21:34:08,879 INFO L445 BasicCegarLoop]: Path program histogram: [11, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 21:34:08,882 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 21:34:08,882 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 21:34:08,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 09:34:08 BasicIcfg [2024-04-05 21:34:08,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 21:34:08,884 INFO L158 Benchmark]: Toolchain (without parser) took 848618.58ms. Allocated memory was 159.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 90.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. [2024-04-05 21:34:08,884 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 159.4MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 21:34:08,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.05ms. Allocated memory is still 159.4MB. Free memory was 90.5MB in the beginning and 78.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-05 21:34:08,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.24ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 21:34:08,884 INFO L158 Benchmark]: Boogie Preprocessor took 21.29ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 75.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 21:34:08,885 INFO L158 Benchmark]: RCFGBuilder took 482.32ms. Allocated memory was 159.4MB in the beginning and 250.6MB in the end (delta: 91.2MB). Free memory was 75.0MB in the beginning and 199.9MB in the end (delta: -124.9MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2024-04-05 21:34:08,885 INFO L158 Benchmark]: TraceAbstraction took 847787.03ms. Allocated memory was 250.6MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 198.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 164.3MB. Max. memory is 8.0GB. [2024-04-05 21:34:08,886 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.33ms. Allocated memory is still 159.4MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.05ms. Allocated memory is still 159.4MB. Free memory was 90.5MB in the beginning and 78.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.24ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.29ms. Allocated memory is still 159.4MB. Free memory was 76.7MB in the beginning and 75.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 482.32ms. Allocated memory was 159.4MB in the beginning and 250.6MB in the end (delta: 91.2MB). Free memory was 75.0MB in the beginning and 199.9MB in the end (delta: -124.9MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * TraceAbstraction took 847787.03ms. Allocated memory was 250.6MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 198.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 164.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 354395, independent: 318318, independent conditional: 312938, independent unconditional: 5380, dependent: 36059, dependent conditional: 33405, dependent unconditional: 2654, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 323997, independent: 318318, independent conditional: 312938, independent unconditional: 5380, dependent: 5661, dependent conditional: 5498, dependent unconditional: 163, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323997, independent: 318318, independent conditional: 312938, independent unconditional: 5380, dependent: 5661, dependent conditional: 5498, dependent unconditional: 163, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 323997, independent: 318318, independent conditional: 312938, independent unconditional: 5380, dependent: 5661, dependent conditional: 5498, dependent unconditional: 163, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 338962, independent: 318318, independent conditional: 18550, independent unconditional: 299768, dependent: 20626, dependent conditional: 10334, dependent unconditional: 10292, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 338962, independent: 318318, independent conditional: 15343, independent unconditional: 302975, dependent: 20626, dependent conditional: 3340, dependent unconditional: 17286, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 338962, independent: 318318, independent conditional: 15343, independent unconditional: 302975, dependent: 20626, dependent conditional: 3340, dependent unconditional: 17286, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1026, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 63, dependent conditional: 51, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1026, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 63, dependent conditional: 51, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 63, dependent conditional: 51, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5129, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1207, dependent conditional: 457, dependent unconditional: 750, unknown: 3922, unknown conditional: 3922, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 338962, independent: 317359, independent conditional: 15343, independent unconditional: 302016, dependent: 20563, dependent conditional: 3289, dependent unconditional: 17274, unknown: 1040, unknown conditional: 69, unknown unconditional: 971] , Statistics on independence cache: Total cache size (in pairs): 1022, Positive cache size: 959, Positive conditional cache size: 0, Positive unconditional cache size: 959, Negative cache size: 63, Negative conditional cache size: 51, Negative unconditional cache size: 12, Unknown cache size: 4, Unknown conditional cache size: 4, Unknown unconditional cache size: 0, Eliminated conditions: 10201, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 338962, independent: 318318, independent conditional: 18550, independent unconditional: 299768, dependent: 20626, dependent conditional: 10334, dependent unconditional: 10292, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 338962, independent: 318318, independent conditional: 15343, independent unconditional: 302975, dependent: 20626, dependent conditional: 3340, dependent unconditional: 17286, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 338962, independent: 318318, independent conditional: 15343, independent unconditional: 302975, dependent: 20626, dependent conditional: 3340, dependent unconditional: 17286, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1026, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 63, dependent conditional: 51, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1026, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 63, dependent conditional: 51, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 63, dependent conditional: 51, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5129, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1207, dependent conditional: 457, dependent unconditional: 750, unknown: 3922, unknown conditional: 3922, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 338962, independent: 317359, independent conditional: 15343, independent unconditional: 302016, dependent: 20563, dependent conditional: 3289, dependent unconditional: 17274, unknown: 1040, unknown conditional: 69, unknown unconditional: 971] , Statistics on independence cache: Total cache size (in pairs): 1022, Positive cache size: 959, Positive conditional cache size: 0, Positive unconditional cache size: 959, Negative cache size: 63, Negative conditional cache size: 51, Negative unconditional cache size: 12, Unknown cache size: 4, Unknown conditional cache size: 4, Unknown unconditional cache size: 0, Eliminated conditions: 10201 ], Independence queries for same thread: 30398 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-7-2-4-3-3-2-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 129]: 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 ∧-7-2-4-3-3-2-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 130]: 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 ∧-7-2-4-3-3-2-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 132]: 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 ∧-7-2-4-3-3-2-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 131]: 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 ∧-7-2-4-3-3-2-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 847.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 11, EmptinessCheckTime: 527.6s, 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: 486, 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.1s SatisfiabilityAnalysisTime, 317.6s InterpolantComputationTime, 2124 NumberOfCodeBlocks, 2086 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2831 ConstructedInterpolants, 0 QuantifiedInterpolants, 43339 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1662 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 3092/11403 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