/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-atomic/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 11:39:01,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 11:39:01,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 11:39:01,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 11:39:01,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 11:39:01,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 11:39:01,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 11:39:01,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 11:39:01,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 11:39:01,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 11:39:01,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 11:39:01,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 11:39:01,726 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 11:39:01,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 11:39:01,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 11:39:01,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 11:39:01,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 11:39:01,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 11:39:01,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 11:39:01,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 11:39:01,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 11:39:01,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 11:39:01,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 11:39:01,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 11:39:01,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 11:39:01,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 11:39:01,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 11:39:01,731 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 11:39:01,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 11:39:01,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 11:39:01,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 11:39:01,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 11:39:01,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 11:39:01,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 11:39:01,733 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 11:39:01,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 11:39:01,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 11:39:01,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 11:39:01,733 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 11:39:01,733 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 11:39:01,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 11:39:01,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 11:39:01,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 11:39:01,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 11:39:01,981 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 11:39:01,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-07 11:39:02,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 11:39:03,208 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 11:39:03,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-07 11:39:03,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/334ee2e9b/4ef6a032d09841fc9c6dbdd2ccc985da/FLAG99ea32a11 [2024-05-07 11:39:03,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/334ee2e9b/4ef6a032d09841fc9c6dbdd2ccc985da [2024-05-07 11:39:03,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 11:39:03,236 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 11:39:03,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 11:39:03,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 11:39:03,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 11:39:03,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4bca2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03, skipping insertion in model container [2024-05-07 11:39:03,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,289 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 11:39:03,545 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-atomic/szymanski.i[31505,31518] [2024-05-07 11:39:03,558 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-atomic/szymanski.i[32915,32928] [2024-05-07 11:39:03,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 11:39:03,574 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 11:39:03,630 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-atomic/szymanski.i[31505,31518] [2024-05-07 11:39:03,633 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-atomic/szymanski.i[32915,32928] [2024-05-07 11:39:03,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 11:39:03,711 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 11:39:03,711 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 11:39:03,717 INFO L206 MainTranslator]: Completed translation [2024-05-07 11:39:03,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03 WrapperNode [2024-05-07 11:39:03,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 11:39:03,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 11:39:03,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 11:39:03,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 11:39:03,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,757 INFO L138 Inliner]: procedures = 170, calls = 74, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2024-05-07 11:39:03,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 11:39:03,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 11:39:03,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 11:39:03,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 11:39:03,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 11:39:03,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 11:39:03,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 11:39:03,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 11:39:03,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (1/1) ... [2024-05-07 11:39:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 11:39:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:39:03,827 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 11:39:03,830 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 11:39:03,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 11:39:03,875 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-07 11:39:03,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-07 11:39:03,876 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-07 11:39:03,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-07 11:39:03,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 11:39:03,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 11:39:03,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 11:39:03,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 11:39:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 11:39:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 11:39:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 11:39:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 11:39:03,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 11:39:03,880 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 11:39:03,978 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 11:39:03,980 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 11:39:04,172 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 11:39:04,183 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 11:39:04,183 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2024-05-07 11:39:04,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 11:39:04 BoogieIcfgContainer [2024-05-07 11:39:04,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 11:39:04,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 11:39:04,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 11:39:04,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 11:39:04,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 11:39:03" (1/3) ... [2024-05-07 11:39:04,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f868b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 11:39:04, skipping insertion in model container [2024-05-07 11:39:04,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 11:39:03" (2/3) ... [2024-05-07 11:39:04,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f868b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 11:39:04, skipping insertion in model container [2024-05-07 11:39:04,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 11:39:04" (3/3) ... [2024-05-07 11:39:04,192 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-05-07 11:39:04,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 11:39:04,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 11:39:04,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-07 11:39:04,207 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 11:39:04,255 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 11:39:04,291 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 11:39:04,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 11:39:04,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:39:04,294 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 11:39:04,296 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 11:39:04,329 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 11:39:04,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:39:04,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 11:39:04,344 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;@2b32ee50, 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 11:39:04,344 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-07 11:39:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1187055960, now seen corresponding path program 1 times [2024-05-07 11:39:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:39:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:39:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 11:39:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-07 11:39:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 645532603, now seen corresponding path program 1 times [2024-05-07 11:39:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:05,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 11:39:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 11:39:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -521405355, now seen corresponding path program 1 times [2024-05-07 11:39:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:39:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:39:05,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 11:39:05,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-07 11:39:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 1 times [2024-05-07 11:39:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:05,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 11:39:05,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:39:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1561719619, now seen corresponding path program 1 times [2024-05-07 11:39:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:39:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343813953] [2024-05-07 11:39:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 11:39:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:39:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343813953] [2024-05-07 11:39:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343813953] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:39:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234380431] [2024-05-07 11:39:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:05,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:39:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:39:05,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 11:39:05,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 11:39:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:05,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-07 11:39:05,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:39:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 11:39:05,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 11:39:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234380431] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 11:39:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 11:39:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-07 11:39:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584332972] [2024-05-07 11:39:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 11:39:05,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 11:39:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:39:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 11:39:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-07 11:39:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:39:05,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:39:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 11:39:05,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:39:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 2 times [2024-05-07 11:39:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 11:39:06,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-07 11:39:06,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-05-07 11:39:06,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 11:39:06,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 11:39:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash -214652225, now seen corresponding path program 1 times [2024-05-07 11:39:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 11:39:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16371382] [2024-05-07 11:39:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 11:39:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 11:39:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16371382] [2024-05-07 11:39:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16371382] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 11:39:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655203989] [2024-05-07 11:39:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:06,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 11:39:06,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 11:39:06,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 11:39:06,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 11:39:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:06,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-07 11:39:06,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 11:39:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-07 11:39:06,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 11:39:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655203989] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 11:39:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 11:39:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-07 11:39:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481135749] [2024-05-07 11:39:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 11:39:06,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 11:39:06,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 11:39:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 11:39:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-07 11:39:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:39:06,539 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 11:39:06,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 11:39:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 11:39:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 11:39:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 673812459, now seen corresponding path program 1 times [2024-05-07 11:39:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:06,835 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 11:39:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:06,884 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 11:39:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:39:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-05-07 11:39:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 3 times [2024-05-07 11:39:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 1 times [2024-05-07 11:39:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 991567198, now seen corresponding path program 1 times [2024-05-07 11:39:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -586650568, now seen corresponding path program 1 times [2024-05-07 11:39:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1006298031, now seen corresponding path program 1 times [2024-05-07 11:39:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1505491961, now seen corresponding path program 1 times [2024-05-07 11:39:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 991609979, now seen corresponding path program 1 times [2024-05-07 11:39:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,672 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 11:39:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,691 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 11:39:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:39:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-05-07 11:39:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 1 times [2024-05-07 11:39:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 4 times [2024-05-07 11:39:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 11:39:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 1 times [2024-05-07 11:39:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 23374588, now seen corresponding path program 1 times [2024-05-07 11:39:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1196573071, now seen corresponding path program 1 times [2024-05-07 11:39:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:08,571 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 11:39:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:08,588 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 11:39:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 11:39:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2024-05-07 11:39:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 2 times [2024-05-07 11:39:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 1 times [2024-05-07 11:39:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 1 times [2024-05-07 11:39:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 652991948, now seen corresponding path program 1 times [2024-05-07 11:39:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:08,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 1 times [2024-05-07 11:39:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 1 times [2024-05-07 11:39:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 520583848, now seen corresponding path program 1 times [2024-05-07 11:39:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash -413165285, now seen corresponding path program 1 times [2024-05-07 11:39:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:09,867 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 11:39:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:09,885 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 11:39:09,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:39:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2024-05-07 11:39:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 2 times [2024-05-07 11:39:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:10,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 2 times [2024-05-07 11:39:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:10,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 520583847, now seen corresponding path program 1 times [2024-05-07 11:39:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:11,092 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 11:39:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:11,113 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 11:39:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:39:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2024-05-07 11:39:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 3 times [2024-05-07 11:39:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:11,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 3 times [2024-05-07 11:39:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:11,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1809995054, now seen corresponding path program 1 times [2024-05-07 11:39:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:12,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1529624573, now seen corresponding path program 1 times [2024-05-07 11:39:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:12,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1090409921, now seen corresponding path program 1 times [2024-05-07 11:39:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:12,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:12,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash 149653968, now seen corresponding path program 1 times [2024-05-07 11:39:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:13,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2083552980, now seen corresponding path program 1 times [2024-05-07 11:39:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:13,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1775018362, now seen corresponding path program 1 times [2024-05-07 11:39:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:14,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1658887888, now seen corresponding path program 2 times [2024-05-07 11:39:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:14,420 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 11:39:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:14,437 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 11:39:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:39:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2024-05-07 11:39:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -433211570, now seen corresponding path program 1 times [2024-05-07 11:39:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:17,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 11:39:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 11:39:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash -876939014, now seen corresponding path program 1 times [2024-05-07 11:39:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:17,989 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 11:39:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 11:39:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 11:39:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 11:39:18,006 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 11:39:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 11:39:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2024-05-07 11:39:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 11:39:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 11:39:21,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-07 11:39:21,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-07 11:39:21,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-07 11:39:21,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-07 11:39:21,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-07 11:39:21,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-07 11:39:21,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 11:39:21,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable30,SelfDestructingSolverStorable52,SelfDestructingSolverStorable31,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable32,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable20,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable44,SelfDestructingSolverStorable23,SelfDestructingSolverStorable45,SelfDestructingSolverStorable24,SelfDestructingSolverStorable46,SelfDestructingSolverStorable25,SelfDestructingSolverStorable47,SelfDestructingSolverStorable26,SelfDestructingSolverStorable48,SelfDestructingSolverStorable27,SelfDestructingSolverStorable49,SelfDestructingSolverStorable28 [2024-05-07 11:39:21,712 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 3, 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] [2024-05-07 11:39:21,715 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 11:39:21,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 11:39:21,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 11:39:21 BasicIcfg [2024-05-07 11:39:21,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 11:39:21,720 INFO L158 Benchmark]: Toolchain (without parser) took 18483.24ms. Allocated memory was 170.9MB in the beginning and 698.4MB in the end (delta: 527.4MB). Free memory was 125.0MB in the beginning and 398.3MB in the end (delta: -273.3MB). Peak memory consumption was 254.2MB. Max. memory is 8.0GB. [2024-05-07 11:39:21,720 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 79.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 11:39:21,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.05ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 124.8MB in the beginning and 182.6MB in the end (delta: -57.9MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2024-05-07 11:39:21,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.49ms. Allocated memory is still 221.2MB. Free memory was 182.6MB in the beginning and 180.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 11:39:21,720 INFO L158 Benchmark]: Boogie Preprocessor took 39.20ms. Allocated memory is still 221.2MB. Free memory was 180.5MB in the beginning and 179.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 11:39:21,721 INFO L158 Benchmark]: RCFGBuilder took 387.34ms. Allocated memory is still 221.2MB. Free memory was 179.0MB in the beginning and 164.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 11:39:21,721 INFO L158 Benchmark]: TraceAbstraction took 17532.37ms. Allocated memory was 221.2MB in the beginning and 698.4MB in the end (delta: 477.1MB). Free memory was 163.2MB in the beginning and 398.3MB in the end (delta: -235.1MB). Peak memory consumption was 243.1MB. Max. memory is 8.0GB. [2024-05-07 11:39:21,725 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.11ms. Allocated memory is still 170.9MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 79.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.05ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 124.8MB in the beginning and 182.6MB in the end (delta: -57.9MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.49ms. Allocated memory is still 221.2MB. Free memory was 182.6MB in the beginning and 180.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.20ms. Allocated memory is still 221.2MB. Free memory was 180.5MB in the beginning and 179.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 387.34ms. Allocated memory is still 221.2MB. Free memory was 179.0MB in the beginning and 164.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17532.37ms. Allocated memory was 221.2MB in the beginning and 698.4MB in the end (delta: 477.1MB). Free memory was 163.2MB in the beginning and 398.3MB in the end (delta: -235.1MB). Peak memory consumption was 243.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: 46403, independent: 41683, independent conditional: 41482, independent unconditional: 201, dependent: 4720, dependent conditional: 4716, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43815, independent: 41683, independent conditional: 41482, independent unconditional: 201, dependent: 2132, dependent conditional: 2128, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43815, independent: 41683, independent conditional: 41482, independent unconditional: 201, dependent: 2132, dependent conditional: 2128, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43815, independent: 41683, independent conditional: 41482, independent unconditional: 201, dependent: 2132, dependent conditional: 2128, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52555, independent: 41683, independent conditional: 18300, independent unconditional: 23383, dependent: 10872, dependent conditional: 8742, dependent unconditional: 2130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52555, independent: 41683, independent conditional: 15718, independent unconditional: 25965, dependent: 10872, dependent conditional: 4583, dependent unconditional: 6289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52555, independent: 41683, independent conditional: 15718, independent unconditional: 25965, dependent: 10872, dependent conditional: 4583, dependent unconditional: 6289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2152, independent: 1801, independent conditional: 453, independent unconditional: 1348, dependent: 351, dependent conditional: 268, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2152, independent: 1801, independent conditional: 0, independent unconditional: 1801, dependent: 351, dependent conditional: 0, dependent unconditional: 351, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 351, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 351, dependent conditional: 268, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 351, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 351, dependent conditional: 268, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 314, dependent conditional: 237, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 52555, independent: 39882, independent conditional: 15265, independent unconditional: 24617, dependent: 10521, dependent conditional: 4315, dependent unconditional: 6206, unknown: 2152, unknown conditional: 721, unknown unconditional: 1431] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 1801, Positive conditional cache size: 453, Positive unconditional cache size: 1348, Negative cache size: 351, Negative conditional cache size: 268, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6741, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52555, independent: 41683, independent conditional: 18300, independent unconditional: 23383, dependent: 10872, dependent conditional: 8742, dependent unconditional: 2130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52555, independent: 41683, independent conditional: 15718, independent unconditional: 25965, dependent: 10872, dependent conditional: 4583, dependent unconditional: 6289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52555, independent: 41683, independent conditional: 15718, independent unconditional: 25965, dependent: 10872, dependent conditional: 4583, dependent unconditional: 6289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2152, independent: 1801, independent conditional: 453, independent unconditional: 1348, dependent: 351, dependent conditional: 268, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2152, independent: 1801, independent conditional: 0, independent unconditional: 1801, dependent: 351, dependent conditional: 0, dependent unconditional: 351, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 351, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 351, dependent conditional: 268, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 351, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 351, dependent conditional: 268, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 314, dependent conditional: 237, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 52555, independent: 39882, independent conditional: 15265, independent unconditional: 24617, dependent: 10521, dependent conditional: 4315, dependent unconditional: 6206, unknown: 2152, unknown conditional: 721, unknown unconditional: 1431] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 1801, Positive conditional cache size: 453, Positive unconditional cache size: 1348, Negative cache size: 351, Negative conditional cache size: 268, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6741 ], Independence queries for same thread: 2588 - PositiveResult [Line: 802]: 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: 745]: 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, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 16.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: 6, 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, 0.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 50/52 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: 14.4s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 10, ConditionalCommutativityConditionCalculations: 342, ConditionalCommutativityTraceChecks: 40, ConditionalCommutativityImperfectProofs: 6 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 11:39:21,737 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 11:39:21,944 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...