/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/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 08:25:16,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 08:25:16,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 08:25:16,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 08:25:16,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 08:25:16,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 08:25:16,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 08:25:16,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 08:25:16,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 08:25:16,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 08:25:16,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 08:25:16,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 08:25:16,282 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 08:25:16,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 08:25:16,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 08:25:16,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 08:25:16,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 08:25:16,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 08:25:16,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 08:25:16,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 08:25:16,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 08:25:16,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 08:25:16,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 08:25:16,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 08:25:16,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 08:25:16,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 08:25:16,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 08:25:16,290 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 08:25:16,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 08:25:16,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 08:25:16,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 08:25:16,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 08:25:16,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 08:25:16,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 08:25:16,292 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 08:25:16,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 08:25:16,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 08:25:16,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 08:25:16,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 08:25:16,292 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-05-07 08:25:16,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 08:25:16,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 08:25:16,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 08:25:16,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 08:25:16,531 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 08:25:16,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 08:25:17,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 08:25:17,867 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 08:25:17,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 08:25:17,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/02f782f19/232736a437a04cb48f2f3324d3fdff2c/FLAGba7f1c225 [2024-05-07 08:25:17,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/02f782f19/232736a437a04cb48f2f3324d3fdff2c [2024-05-07 08:25:17,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 08:25:17,904 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 08:25:17,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 08:25:17,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 08:25:17,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 08:25:17,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:25:17" (1/1) ... [2024-05-07 08:25:17,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380a638c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:17, skipping insertion in model container [2024-05-07 08:25:17,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:25:17" (1/1) ... [2024-05-07 08:25:17,955 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 08:25:18,067 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 08:25:18,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 08:25:18,195 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 08:25:18,210 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 08:25:18,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 08:25:18,278 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 08:25:18,279 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 08:25:18,284 INFO L206 MainTranslator]: Completed translation [2024-05-07 08:25:18,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18 WrapperNode [2024-05-07 08:25:18,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 08:25:18,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 08:25:18,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 08:25:18,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 08:25:18,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,314 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-05-07 08:25:18,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 08:25:18,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 08:25:18,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 08:25:18,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 08:25:18,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 08:25:18,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 08:25:18,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 08:25:18,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 08:25:18,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (1/1) ... [2024-05-07 08:25:18,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 08:25:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:25:18,359 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-05-07 08:25:18,361 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-05-07 08:25:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 08:25:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 08:25:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 08:25:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 08:25:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 08:25:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 08:25:18,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 08:25:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 08:25:18,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 08:25:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 08:25:18,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 08:25:18,399 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-07 08:25:18,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-07 08:25:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 08:25:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 08:25:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 08:25:18,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 08:25:18,401 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 08:25:18,511 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 08:25:18,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 08:25:18,681 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 08:25:18,689 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 08:25:18,690 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 08:25:18,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:25:18 BoogieIcfgContainer [2024-05-07 08:25:18,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 08:25:18,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 08:25:18,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 08:25:18,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 08:25:18,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 08:25:17" (1/3) ... [2024-05-07 08:25:18,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9aed63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:25:18, skipping insertion in model container [2024-05-07 08:25:18,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:25:18" (2/3) ... [2024-05-07 08:25:18,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9aed63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:25:18, skipping insertion in model container [2024-05-07 08:25:18,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:25:18" (3/3) ... [2024-05-07 08:25:18,697 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 08:25:18,703 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 08:25:18,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 08:25:18,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 08:25:18,711 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 08:25:18,771 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 08:25:18,805 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 08:25:18,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 08:25:18,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 08:25:18,808 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-05-07 08:25:18,812 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-05-07 08:25:18,846 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 08:25:18,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:25:18,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 08:25:18,875 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;@565bc26e, 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, mConComCheckerConditionCriterion=false [2024-05-07 08:25:18,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 08:25:18,950 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-05-07 08:25:18,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:25:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 54997643, now seen corresponding path program 1 times [2024-05-07 08:25:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:25:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113792482] [2024-05-07 08:25:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:25:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:25:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:25:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113792482] [2024-05-07 08:25:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113792482] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:25:19,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:25:19,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 08:25:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214488285] [2024-05-07 08:25:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:25:19,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 08:25:19,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:25:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 08:25:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 08:25:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:19,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:25:19,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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-05-07 08:25:19,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:19,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 08:25:19,333 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-05-07 08:25:19,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:25:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1155189243, now seen corresponding path program 1 times [2024-05-07 08:25:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:25:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406264561] [2024-05-07 08:25:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:25:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:25:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:25:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406264561] [2024-05-07 08:25:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406264561] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:25:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:25:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 08:25:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840699760] [2024-05-07 08:25:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:25:19,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 08:25:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:25:19,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 08:25:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 08:25:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:19,732 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:25:19,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-05-07 08:25:19,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:19,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:20,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 08:25:20,013 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-05-07 08:25:20,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:25:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1810607036, now seen corresponding path program 1 times [2024-05-07 08:25:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:25:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932853322] [2024-05-07 08:25:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:25:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:25:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:25:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932853322] [2024-05-07 08:25:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932853322] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:25:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:25:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-07 08:25:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815586896] [2024-05-07 08:25:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:25:20,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-07 08:25:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:25:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-07 08:25:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-07 08:25:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:20,318 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:25:20,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 08:25:20,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:20,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:20,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash -192334217, now seen corresponding path program 1 times [2024-05-07 08:25:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:20,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash 857917268, now seen corresponding path program 1 times [2024-05-07 08:25:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:20,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1886820646, now seen corresponding path program 1 times [2024-05-07 08:25:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash -90564032, now seen corresponding path program 1 times [2024-05-07 08:25:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1846531870, now seen corresponding path program 1 times [2024-05-07 08:25:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1624266024, now seen corresponding path program 1 times [2024-05-07 08:25:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1194530337, now seen corresponding path program 1 times [2024-05-07 08:25:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash 716080616, now seen corresponding path program 1 times [2024-05-07 08:25:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash 317105244, now seen corresponding path program 1 times [2024-05-07 08:25:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:21,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 903427491, now seen corresponding path program 1 times [2024-05-07 08:25:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1830258161, now seen corresponding path program 1 times [2024-05-07 08:25:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash 197587929, now seen corresponding path program 1 times [2024-05-07 08:25:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 755512094, now seen corresponding path program 1 times [2024-05-07 08:25:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1830358309, now seen corresponding path program 1 times [2024-05-07 08:25:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 356598227, now seen corresponding path program 1 times [2024-05-07 08:25:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1841905404, now seen corresponding path program 1 times [2024-05-07 08:25:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1978093006, now seen corresponding path program 1 times [2024-05-07 08:25:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:22,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash 260677402, now seen corresponding path program 1 times [2024-05-07 08:25:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 587993055, now seen corresponding path program 1 times [2024-05-07 08:25:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -359052303, now seen corresponding path program 1 times [2024-05-07 08:25:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -162779874, now seen corresponding path program 1 times [2024-05-07 08:25:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1208982146, now seen corresponding path program 1 times [2024-05-07 08:25:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash -165514198, now seen corresponding path program 1 times [2024-05-07 08:25:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 790431355, now seen corresponding path program 1 times [2024-05-07 08:25:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash -667237920, now seen corresponding path program 1 times [2024-05-07 08:25:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1159294617, now seen corresponding path program 1 times [2024-05-07 08:25:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1449735209, now seen corresponding path program 1 times [2024-05-07 08:25:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:23,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -75103119, now seen corresponding path program 1 times [2024-05-07 08:25:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2038970704, now seen corresponding path program 1 times [2024-05-07 08:25:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash 488418244, now seen corresponding path program 1 times [2024-05-07 08:25:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1061910312, now seen corresponding path program 1 times [2024-05-07 08:25:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,422 INFO L85 PathProgramCache]: Analyzing trace with hash 726993500, now seen corresponding path program 1 times [2024-05-07 08:25:24,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1131615318, now seen corresponding path program 1 times [2024-05-07 08:25:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-07 08:25:24,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 08:25:24,654 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-05-07 08:25:24,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:25:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1436304185, now seen corresponding path program 1 times [2024-05-07 08:25:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:25:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362912678] [2024-05-07 08:25:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:25:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:25:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:25:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362912678] [2024-05-07 08:25:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362912678] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:25:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:25:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 08:25:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432437859] [2024-05-07 08:25:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:25:24,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 08:25:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:25:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 08:25:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 08:25:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:24,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:25:24,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-05-07 08:25:24,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:24,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:24,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-07 08:25:24,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-07 08:25:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 08:25:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-07 08:25:29,741 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-05-07 08:25:29,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 08:25:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash 764175823, now seen corresponding path program 2 times [2024-05-07 08:25:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 08:25:29,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607531711] [2024-05-07 08:25:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 08:25:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 08:25:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 08:25:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607531711] [2024-05-07 08:25:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607531711] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 08:25:29,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 08:25:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 08:25:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859765409] [2024-05-07 08:25:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 08:25:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 08:25:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 08:25:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 08:25:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 08:25:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:29,963 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 08:25:29,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-05-07 08:25:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-07 08:25:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 08:25:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 441626281, now seen corresponding path program 1 times [2024-05-07 08:25:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1867298117, now seen corresponding path program 1 times [2024-05-07 08:25:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash 525061864, now seen corresponding path program 1 times [2024-05-07 08:25:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1312309096, now seen corresponding path program 1 times [2024-05-07 08:25:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1330445380, now seen corresponding path program 1 times [2024-05-07 08:25:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1434590370, now seen corresponding path program 1 times [2024-05-07 08:25:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1271446823, now seen corresponding path program 1 times [2024-05-07 08:25:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:36,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1939283990, now seen corresponding path program 2 times [2024-05-07 08:25:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:37,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash -334674104, now seen corresponding path program 1 times [2024-05-07 08:25:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:37,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2015789430, now seen corresponding path program 1 times [2024-05-07 08:25:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 08:25:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 08:25:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:37,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 08:25:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 08:25:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 08:25:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 08:25:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-07 08:25:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 08:25:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 08:25:38,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 08:25:38,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-07 08:25:38,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 08:25:38,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 08:25:38,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-07 08:25:38,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-07 08:25:38,505 INFO L448 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 08:25:38,507 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 08:25:38,507 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 08:25:38,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 08:25:38 BasicIcfg [2024-05-07 08:25:38,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 08:25:38,510 INFO L158 Benchmark]: Toolchain (without parser) took 20605.80ms. Allocated memory was 280.0MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 211.7MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 636.1MB. Max. memory is 8.0GB. [2024-05-07 08:25:38,510 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory was 146.0MB in the beginning and 146.0MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 08:25:38,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.28ms. Allocated memory is still 280.0MB. Free memory was 211.2MB in the beginning and 190.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-07 08:25:38,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.97ms. Allocated memory is still 280.0MB. Free memory was 190.2MB in the beginning and 188.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 08:25:38,510 INFO L158 Benchmark]: Boogie Preprocessor took 17.30ms. Allocated memory is still 280.0MB. Free memory was 188.1MB in the beginning and 187.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 08:25:38,511 INFO L158 Benchmark]: RCFGBuilder took 358.42ms. Allocated memory is still 280.0MB. Free memory was 186.5MB in the beginning and 243.4MB in the end (delta: -56.9MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2024-05-07 08:25:38,511 INFO L158 Benchmark]: TraceAbstraction took 19816.20ms. Allocated memory was 280.0MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 242.4MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 665.7MB. Max. memory is 8.0GB. [2024-05-07 08:25:38,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory was 146.0MB in the beginning and 146.0MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.28ms. Allocated memory is still 280.0MB. Free memory was 211.2MB in the beginning and 190.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.97ms. Allocated memory is still 280.0MB. Free memory was 190.2MB in the beginning and 188.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.30ms. Allocated memory is still 280.0MB. Free memory was 188.1MB in the beginning and 187.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 358.42ms. Allocated memory is still 280.0MB. Free memory was 186.5MB in the beginning and 243.4MB in the end (delta: -56.9MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * TraceAbstraction took 19816.20ms. Allocated memory was 280.0MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 242.4MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 665.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1301467, independent: 1285968, independent conditional: 1285744, independent unconditional: 224, dependent: 15499, dependent conditional: 15498, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1301183, independent: 1285968, independent conditional: 1285744, independent unconditional: 224, dependent: 15215, dependent conditional: 15214, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1301183, independent: 1285968, independent conditional: 1285744, independent unconditional: 224, dependent: 15215, dependent conditional: 15214, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1301183, independent: 1285968, independent conditional: 1285744, independent unconditional: 224, dependent: 15215, dependent conditional: 15214, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1342584, independent: 1285968, independent conditional: 622868, independent unconditional: 663100, dependent: 56616, dependent conditional: 41399, dependent unconditional: 15217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1342584, independent: 1285968, independent conditional: 262733, independent unconditional: 1023235, dependent: 56616, dependent conditional: 12211, dependent unconditional: 44405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1342584, independent: 1285968, independent conditional: 262733, independent unconditional: 1023235, dependent: 56616, dependent conditional: 12211, dependent unconditional: 44405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1717, independent: 1679, independent conditional: 286, independent unconditional: 1393, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1717, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 36, independent conditional: 27, independent unconditional: 9, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 36, independent conditional: 27, independent unconditional: 9, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 40, independent conditional: 33, independent unconditional: 6, dependent: 61, dependent conditional: 41, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1342584, independent: 1284289, independent conditional: 262447, independent unconditional: 1021842, dependent: 56578, dependent conditional: 12193, dependent unconditional: 44385, unknown: 1717, unknown conditional: 304, unknown unconditional: 1413] , Statistics on independence cache: Total cache size (in pairs): 1717, Positive cache size: 1679, Positive conditional cache size: 286, Positive unconditional cache size: 1393, Negative cache size: 38, Negative conditional cache size: 18, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 389323, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1342584, independent: 1285968, independent conditional: 622868, independent unconditional: 663100, dependent: 56616, dependent conditional: 41399, dependent unconditional: 15217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1342584, independent: 1285968, independent conditional: 262733, independent unconditional: 1023235, dependent: 56616, dependent conditional: 12211, dependent unconditional: 44405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1342584, independent: 1285968, independent conditional: 262733, independent unconditional: 1023235, dependent: 56616, dependent conditional: 12211, dependent unconditional: 44405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1717, independent: 1679, independent conditional: 286, independent unconditional: 1393, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1717, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 36, independent conditional: 27, independent unconditional: 9, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 36, independent conditional: 27, independent unconditional: 9, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 40, independent conditional: 33, independent unconditional: 6, dependent: 61, dependent conditional: 41, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1342584, independent: 1284289, independent conditional: 262447, independent unconditional: 1021842, dependent: 56578, dependent conditional: 12193, dependent unconditional: 44385, unknown: 1717, unknown conditional: 304, unknown unconditional: 1413] , Statistics on independence cache: Total cache size (in pairs): 1717, Positive cache size: 1679, Positive conditional cache size: 286, Positive unconditional cache size: 1393, Negative cache size: 38, Negative conditional cache size: 18, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 389323 ], Independence queries for same thread: 284 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 139 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 18.1s, 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: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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, ConditionalCommutativityCheckTime: 6.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 100, ConditionalCommutativityTraceChecks: 43, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 08:25:38,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-07 08:25:38,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...