/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 12:29:36,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 12:29:36,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 12:29:36,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 12:29:36,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 12:29:36,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 12:29:36,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 12:29:36,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 12:29:36,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 12:29:36,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 12:29:36,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 12:29:36,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 12:29:36,759 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 12:29:36,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 12:29:36,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 12:29:36,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 12:29:36,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 12:29:36,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 12:29:36,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 12:29:36,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 12:29:36,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 12:29:36,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 12:29:36,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 12:29:36,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 12:29:36,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 12:29:36,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 12:29:36,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 12:29:36,764 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 12:29:36,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 12:29:36,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 12:29:36,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 12:29:36,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 12:29:36,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 12:29:36,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 12:29:36,765 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 12:29:36,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 12:29:36,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 12:29:36,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 12:29:36,766 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 12:29:36,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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 12:29:36,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 12:29:36,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 12:29:36,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 12:29:36,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 12:29:36,976 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 12:29:36,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-07 12:29:38,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 12:29:38,321 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 12:29:38,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-07 12:29:38,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca913f32d/62e8a42901704863855671f571ad9b03/FLAG3629afd4d [2024-05-07 12:29:38,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca913f32d/62e8a42901704863855671f571ad9b03 [2024-05-07 12:29:38,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 12:29:38,355 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 12:29:38,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 12:29:38,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 12:29:38,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 12:29:38,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6c60fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38, skipping insertion in model container [2024-05-07 12:29:38,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 12:29:38,527 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-05-07 12:29:38,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 12:29:38,726 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 12:29:38,735 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-05-07 12:29:38,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 12:29:38,821 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 12:29:38,822 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 12:29:38,827 INFO L206 MainTranslator]: Completed translation [2024-05-07 12:29:38,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38 WrapperNode [2024-05-07 12:29:38,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 12:29:38,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 12:29:38,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 12:29:38,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 12:29:38,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,879 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-05-07 12:29:38,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 12:29:38,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 12:29:38,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 12:29:38,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 12:29:38,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 12:29:38,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 12:29:38,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 12:29:38,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 12:29:38,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (1/1) ... [2024-05-07 12:29:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 12:29:38,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 12:29:39,005 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 12:29:39,024 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 12:29:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 12:29:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 12:29:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 12:29:39,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 12:29:39,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 12:29:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 12:29:39,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 12:29:39,047 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 12:29:39,161 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 12:29:39,164 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 12:29:39,462 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 12:29:39,609 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 12:29:39,610 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 12:29:39,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:29:39 BoogieIcfgContainer [2024-05-07 12:29:39,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 12:29:39,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 12:29:39,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 12:29:39,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 12:29:39,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:29:38" (1/3) ... [2024-05-07 12:29:39,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90b3f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:29:39, skipping insertion in model container [2024-05-07 12:29:39,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:38" (2/3) ... [2024-05-07 12:29:39,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90b3f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:29:39, skipping insertion in model container [2024-05-07 12:29:39,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:29:39" (3/3) ... [2024-05-07 12:29:39,618 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-07 12:29:39,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 12:29:39,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 12:29:39,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-07 12:29:39,634 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 12:29:39,672 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 12:29:39,712 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 12:29:39,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 12:29:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 12:29:39,724 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 12:29:39,748 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 12:29:39,771 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 12:29:39,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:39,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 12:29:39,787 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;@69139103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 12:29:39,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 12:29:39,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 12:29:39,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1240377627, now seen corresponding path program 1 times [2024-05-07 12:29:39,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:29:39,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346664069] [2024-05-07 12:29:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:40,334 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 12:29:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:29:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346664069] [2024-05-07 12:29:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346664069] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:29:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:29:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 12:29:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486635444] [2024-05-07 12:29:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:29:40,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 12:29:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:29:40,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 12:29:40,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 12:29:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:40,361 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:29:40,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 12:29:40,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 12:29:40,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 12:29:40,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2097348875, now seen corresponding path program 1 times [2024-05-07 12:29:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:29:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236540696] [2024-05-07 12:29:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:41,212 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 12:29:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:29:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236540696] [2024-05-07 12:29:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236540696] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:29:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:29:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 12:29:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704560040] [2024-05-07 12:29:41,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:29:41,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 12:29:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:29:41,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 12:29:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 12:29:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:41,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:29:41,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 12:29:41,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:41,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 338002539, now seen corresponding path program 1 times [2024-05-07 12:29:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:55,013 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 12:29:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:56,027 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 12:29:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-07 12:29:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-05-07 12:30:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:30:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:30:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 12:30:28,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 12:30:28,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:30:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2094141065, now seen corresponding path program 1 times [2024-05-07 12:30:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:30:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574963652] [2024-05-07 12:30:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:30:29,218 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 12:30:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:30:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574963652] [2024-05-07 12:30:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574963652] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:30:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:30:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 12:30:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441985965] [2024-05-07 12:30:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:30:29,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 12:30:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:30:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 12:30:29,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 12:30:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:30:29,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:30:29,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 12:30:29,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:30:29,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:30:29,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:31:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -925757740, now seen corresponding path program 1 times [2024-05-07 12:31:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:44,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1790391655, now seen corresponding path program 1 times [2024-05-07 12:32:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:32:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:32:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:32:17,463 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 12:32:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:32:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:32:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:32:17,511 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 12:32:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 12:32:17,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-05-07 12:32:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -723296781, now seen corresponding path program 1 times [2024-05-07 12:32:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:32:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:32:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:36,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:32:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:33:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -925757740, now seen corresponding path program 2 times [2024-05-07 12:33:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:33:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:33:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:33:20,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:33:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:33:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash -440498754, now seen corresponding path program 1 times [2024-05-07 12:33:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:33:22,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:33:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:33:22,342 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 12:33:22,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:33:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:33:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:33:22,429 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 12:33:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 12:33:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2024-05-07 12:35:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash -925757740, now seen corresponding path program 3 times [2024-05-07 12:35:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:20,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1338561715, now seen corresponding path program 1 times [2024-05-07 12:35:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:21,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:33,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1454336119, now seen corresponding path program 1 times [2024-05-07 12:35:33,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:33,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1147209197, now seen corresponding path program 1 times [2024-05-07 12:35:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:34,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1203427081, now seen corresponding path program 1 times [2024-05-07 12:35:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:41,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1147234154, now seen corresponding path program 1 times [2024-05-07 12:35:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:49,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1485200397, now seen corresponding path program 1 times [2024-05-07 12:35:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:50,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash -189201861, now seen corresponding path program 1 times [2024-05-07 12:35:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:57,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:35:57,646 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 12:35:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:35:57,690 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 12:35:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 12:35:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2024-05-07 12:35:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1790212022, now seen corresponding path program 1 times [2024-05-07 12:35:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:35:59,607 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 12:35:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:35:59,688 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 12:35:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 12:35:59,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2024-05-07 12:35:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1779200026, now seen corresponding path program 1 times [2024-05-07 12:35:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:59,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash -925757740, now seen corresponding path program 4 times [2024-05-07 12:36:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:00,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1338561715, now seen corresponding path program 2 times [2024-05-07 12:36:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:00,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1203746646, now seen corresponding path program 1 times [2024-05-07 12:36:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:03,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1147209197, now seen corresponding path program 2 times [2024-05-07 12:36:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:06,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1338544818, now seen corresponding path program 1 times [2024-05-07 12:36:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:12,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:12,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1348466494, now seen corresponding path program 1 times [2024-05-07 12:36:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:14,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1203834595, now seen corresponding path program 1 times [2024-05-07 12:36:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:23,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash -879193612, now seen corresponding path program 1 times [2024-05-07 12:36:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:29,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash 248733594, now seen corresponding path program 1 times [2024-05-07 12:36:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:32,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1434350010, now seen corresponding path program 1 times [2024-05-07 12:36:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:47,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash -189125910, now seen corresponding path program 1 times [2024-05-07 12:37:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:37:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:37:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:03,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:37:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1567935529, now seen corresponding path program 2 times [2024-05-07 12:37:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:37:08,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:37:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:08,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:37:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash -697314794, now seen corresponding path program 1 times [2024-05-07 12:37:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:37:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:37:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:28,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:37:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -141921749, now seen corresponding path program 2 times [2024-05-07 12:37:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:37:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:37:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:34,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:37:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1778643415, now seen corresponding path program 1 times [2024-05-07 12:37:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:37:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:37:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:48,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:37:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1165792711, now seen corresponding path program 1 times [2024-05-07 12:38:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:11,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:38:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:38:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:38:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 12:38:11,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 12:38:11,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 12:38:11,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:38:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -838298706, now seen corresponding path program 1 times [2024-05-07 12:38:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:38:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938519303] [2024-05-07 12:38:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:38:11,366 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 12:38:11,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:38:11,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938519303] [2024-05-07 12:38:11,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938519303] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:38:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:38:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-07 12:38:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561546068] [2024-05-07 12:38:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:38:11,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-07 12:38:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:38:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-07 12:38:11,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-07 12:38:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:38:11,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:38:11,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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 12:38:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:38:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:38:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 12:38:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:38:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1779200026, now seen corresponding path program 2 times [2024-05-07 12:38:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:11,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:38:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash -925757740, now seen corresponding path program 5 times [2024-05-07 12:38:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:11,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:38:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1454336119, now seen corresponding path program 3 times [2024-05-07 12:38:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:20,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:38:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1203834595, now seen corresponding path program 3 times [2024-05-07 12:38:27,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:27,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:38:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1147234154, now seen corresponding path program 2 times [2024-05-07 12:38:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:38:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:38:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:38:33,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:38:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:39:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash -585288707, now seen corresponding path program 2 times [2024-05-07 12:39:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:39:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:39:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:39:38,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:39:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:40:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:40:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 12:40:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 12:40:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 12:40:32,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 12:40:32,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-07 12:40:32,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 12:40:32,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 12:40:32,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-07 12:40:32,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46 [2024-05-07 12:40:32,267 INFO L448 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 12:40:32,270 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 12:40:32,270 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 12:40:32,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:40:32 BasicIcfg [2024-05-07 12:40:32,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 12:40:32,273 INFO L158 Benchmark]: Toolchain (without parser) took 653918.40ms. Allocated memory was 154.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 86.2MB in the beginning and 931.0MB in the end (delta: -844.8MB). Peak memory consumption was 187.7MB. Max. memory is 8.0GB. [2024-05-07 12:40:32,273 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 154.1MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 12:40:32,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.13ms. Allocated memory was 154.1MB in the beginning and 205.5MB in the end (delta: 51.4MB). Free memory was 86.0MB in the beginning and 166.4MB in the end (delta: -80.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2024-05-07 12:40:32,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.23ms. Allocated memory is still 205.5MB. Free memory was 165.8MB in the beginning and 163.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 12:40:32,274 INFO L158 Benchmark]: Boogie Preprocessor took 53.46ms. Allocated memory is still 205.5MB. Free memory was 163.2MB in the beginning and 161.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 12:40:32,274 INFO L158 Benchmark]: RCFGBuilder took 672.49ms. Allocated memory is still 205.5MB. Free memory was 160.6MB in the beginning and 110.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2024-05-07 12:40:32,274 INFO L158 Benchmark]: TraceAbstraction took 652659.81ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 980.4MB). Free memory was 109.2MB in the beginning and 931.0MB in the end (delta: -821.8MB). Peak memory consumption was 159.1MB. Max. memory is 8.0GB. [2024-05-07 12:40:32,275 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.09ms. Allocated memory is still 154.1MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.13ms. Allocated memory was 154.1MB in the beginning and 205.5MB in the end (delta: 51.4MB). Free memory was 86.0MB in the beginning and 166.4MB in the end (delta: -80.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.23ms. Allocated memory is still 205.5MB. Free memory was 165.8MB in the beginning and 163.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.46ms. Allocated memory is still 205.5MB. Free memory was 163.2MB in the beginning and 161.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 672.49ms. Allocated memory is still 205.5MB. Free memory was 160.6MB in the beginning and 110.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 652659.81ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 980.4MB). Free memory was 109.2MB in the beginning and 931.0MB in the end (delta: -821.8MB). Peak memory consumption was 159.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17232, independent: 16606, independent conditional: 16552, independent unconditional: 54, dependent: 626, dependent conditional: 626, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17172, independent: 16606, independent conditional: 16552, independent unconditional: 54, dependent: 566, dependent conditional: 566, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17172, independent: 16606, independent conditional: 16552, independent unconditional: 54, dependent: 566, dependent conditional: 566, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17172, independent: 16606, independent conditional: 16552, independent unconditional: 54, dependent: 566, dependent conditional: 566, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19622, independent: 16606, independent conditional: 7777, independent unconditional: 8829, dependent: 3016, dependent conditional: 2431, dependent unconditional: 585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19622, independent: 16606, independent conditional: 4830, independent unconditional: 11776, dependent: 3016, dependent conditional: 1318, dependent unconditional: 1698, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19622, independent: 16606, independent conditional: 4830, independent unconditional: 11776, dependent: 3016, dependent conditional: 1318, dependent unconditional: 1698, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 754, independent: 662, independent conditional: 169, independent unconditional: 493, dependent: 92, dependent conditional: 67, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 754, independent: 644, independent conditional: 0, independent unconditional: 644, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 110, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 92, dependent conditional: 67, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 92, dependent conditional: 67, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 805, independent: 90, independent conditional: 87, independent unconditional: 3, dependent: 715, dependent conditional: 555, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19622, independent: 15944, independent conditional: 4661, independent unconditional: 11283, dependent: 2924, dependent conditional: 1251, dependent unconditional: 1673, unknown: 754, unknown conditional: 236, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 662, Positive conditional cache size: 169, Positive unconditional cache size: 493, Negative cache size: 92, Negative conditional cache size: 67, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4060, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19622, independent: 16606, independent conditional: 7777, independent unconditional: 8829, dependent: 3016, dependent conditional: 2431, dependent unconditional: 585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19622, independent: 16606, independent conditional: 4830, independent unconditional: 11776, dependent: 3016, dependent conditional: 1318, dependent unconditional: 1698, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19622, independent: 16606, independent conditional: 4830, independent unconditional: 11776, dependent: 3016, dependent conditional: 1318, dependent unconditional: 1698, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 754, independent: 662, independent conditional: 169, independent unconditional: 493, dependent: 92, dependent conditional: 67, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 754, independent: 644, independent conditional: 0, independent unconditional: 644, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 110, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 92, dependent conditional: 67, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 92, dependent conditional: 67, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 805, independent: 90, independent conditional: 87, independent unconditional: 3, dependent: 715, dependent conditional: 555, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19622, independent: 15944, independent conditional: 4661, independent unconditional: 11283, dependent: 2924, dependent conditional: 1251, dependent unconditional: 1673, unknown: 754, unknown conditional: 236, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 662, Positive conditional cache size: 169, Positive unconditional cache size: 493, Negative cache size: 92, Negative conditional cache size: 67, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4060 ], Independence queries for same thread: 60 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 5 procedures, 116 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 652.5s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 650.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 27, 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.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 648.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 5, ConditionalCommutativityConditionCalculations: 146, ConditionalCommutativityTraceChecks: 38, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 12:40:32,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-07 12:40:32,595 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...