/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 DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -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-06 13:22:08,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 13:22:08,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 13:22:08,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 13:22:08,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 13:22:08,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 13:22:08,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 13:22:08,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 13:22:08,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 13:22:08,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 13:22:08,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 13:22:08,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 13:22:08,393 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 13:22:08,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 13:22:08,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 13:22:08,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 13:22:08,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 13:22:08,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 13:22:08,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 13:22:08,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 13:22:08,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 13:22:08,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 13:22:08,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 13:22:08,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 13:22:08,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 13:22:08,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 13:22:08,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 13:22:08,397 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 13:22:08,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 13:22:08,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:22:08,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 13:22:08,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 13:22:08,400 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 13:22:08,400 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 -> DEFAULT 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 -> 50 [2024-05-06 13:22:08,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 13:22:08,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 13:22:08,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 13:22:08,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 13:22:08,655 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 13:22:08,656 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-06 13:22:09,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 13:22:10,099 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 13:22:10,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-06 13:22:10,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85289eb2f/223946cbd15442f98fa75b7a59a2a41b/FLAGa2b09d124 [2024-05-06 13:22:10,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85289eb2f/223946cbd15442f98fa75b7a59a2a41b [2024-05-06 13:22:10,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 13:22:10,130 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 13:22:10,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 13:22:10,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 13:22:10,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 13:22:10,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0a32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10, skipping insertion in model container [2024-05-06 13:22:10,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 13:22:10,497 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-06 13:22:10,507 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-06 13:22:10,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:22:10,524 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 13:22:10,561 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-06 13:22:10,564 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-06 13:22:10,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:22:10,604 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:22:10,604 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:22:10,610 INFO L206 MainTranslator]: Completed translation [2024-05-06 13:22:10,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10 WrapperNode [2024-05-06 13:22:10,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 13:22:10,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 13:22:10,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 13:22:10,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 13:22:10,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,654 INFO L138 Inliner]: procedures = 170, calls = 74, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2024-05-06 13:22:10,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 13:22:10,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 13:22:10,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 13:22:10,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 13:22:10,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 13:22:10,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 13:22:10,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 13:22:10,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 13:22:10,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (1/1) ... [2024-05-06 13:22:10,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:22:10,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:22:10,740 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-06 13:22:10,742 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-06 13:22:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 13:22:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-06 13:22:10,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-06 13:22:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-06 13:22:10,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-06 13:22:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 13:22:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 13:22:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 13:22:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 13:22:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 13:22:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 13:22:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 13:22:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 13:22:10,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 13:22:10,784 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 13:22:10,905 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 13:22:10,907 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 13:22:11,125 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 13:22:11,133 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 13:22:11,133 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2024-05-06 13:22:11,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:22:11 BoogieIcfgContainer [2024-05-06 13:22:11,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 13:22:11,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 13:22:11,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 13:22:11,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 13:22:11,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:22:10" (1/3) ... [2024-05-06 13:22:11,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a1e8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:22:11, skipping insertion in model container [2024-05-06 13:22:11,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:22:10" (2/3) ... [2024-05-06 13:22:11,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a1e8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:22:11, skipping insertion in model container [2024-05-06 13:22:11,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:22:11" (3/3) ... [2024-05-06 13:22:11,144 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-05-06 13:22:11,151 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 13:22:11,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 13:22:11,158 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 13:22:11,158 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 13:22:11,231 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 13:22:11,271 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 13:22:11,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 13:22:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:22:11,274 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-06 13:22:11,309 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-06 13:22:11,314 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 13:22:11,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:22:11,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 13:22:11,331 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;@4a3cc05b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 13:22:11,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 13:22:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 623440169, now seen corresponding path program 1 times [2024-05-06 13:22:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:11,922 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-06 13:22:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:11,986 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-06 13:22:12,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:22:12,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 13:22:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash 645532603, now seen corresponding path program 1 times [2024-05-06 13:22:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,211 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-06 13:22:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,262 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-06 13:22:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:22:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 13:22:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash -521405355, now seen corresponding path program 1 times [2024-05-06 13:22:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,367 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-06 13:22:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,399 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-06 13:22:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:22:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-05-06 13:22:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 1 times [2024-05-06 13:22:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,526 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-06 13:22:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,604 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-06 13:22:12,649 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-06 13:22:12,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:22:12,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1561719619, now seen corresponding path program 1 times [2024-05-06 13:22:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:22:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458436708] [2024-05-06 13:22:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,688 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-06 13:22:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:22:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458436708] [2024-05-06 13:22:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458436708] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 13:22:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464688928] [2024-05-06 13:22:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 13:22:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:22:12,738 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-06 13:22:12,740 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-06 13:22:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-06 13:22:12,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 13:22:12,822 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-06 13:22:12,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 13:22:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464688928] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:22:12,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 13:22:12,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-06 13:22:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675369192] [2024-05-06 13:22:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:22:12,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 13:22:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:22:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:22:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 13:22:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:12,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:22:12,830 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-06 13:22:12,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 2 times [2024-05-06 13:22:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,917 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-06 13:22:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:12,941 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-06 13:22:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:12,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 13:22:13,170 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-06 13:22:13,171 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-06 13:22:13,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:22:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -214652225, now seen corresponding path program 1 times [2024-05-06 13:22:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:22:13,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800821374] [2024-05-06 13:22:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,221 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-06 13:22:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:22:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800821374] [2024-05-06 13:22:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800821374] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 13:22:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47894235] [2024-05-06 13:22:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 13:22:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:22:13,226 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-06 13:22:13,256 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-06 13:22:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-06 13:22:13,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 13:22:13,322 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-06 13:22:13,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 13:22:13,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47894235] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:22:13,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 13:22:13,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-06 13:22:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702138934] [2024-05-06 13:22:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:22:13,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 13:22:13,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:22:13,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:22:13,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 13:22:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:13,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:22:13,324 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-06 13:22:13,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:13,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 3 times [2024-05-06 13:22:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,406 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-06 13:22:13,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,433 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-06 13:22:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1007501233, now seen corresponding path program 1 times [2024-05-06 13:22:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,592 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-06 13:22:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,634 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-06 13:22:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:13,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-05-06 13:22:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 1 times [2024-05-06 13:22:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:13,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 4 times [2024-05-06 13:22:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,874 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-06 13:22:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:13,894 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-06 13:22:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 1 times [2024-05-06 13:22:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:13,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash 991567198, now seen corresponding path program 1 times [2024-05-06 13:22:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash -586650568, now seen corresponding path program 1 times [2024-05-06 13:22:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1006298031, now seen corresponding path program 1 times [2024-05-06 13:22:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,204 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-06 13:22:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,228 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-06 13:22:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash -684754539, now seen corresponding path program 1 times [2024-05-06 13:22:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,300 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-06 13:22:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,321 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-06 13:22:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash -919102792, now seen corresponding path program 1 times [2024-05-06 13:22:14,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,380 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-06 13:22:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,432 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-06 13:22:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1505491961, now seen corresponding path program 1 times [2024-05-06 13:22:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,491 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-06 13:22:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,512 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-06 13:22:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 991609979, now seen corresponding path program 1 times [2024-05-06 13:22:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,582 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-06 13:22:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,603 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-06 13:22:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:14,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-05-06 13:22:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 2 times [2024-05-06 13:22:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 5 times [2024-05-06 13:22:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,842 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-06 13:22:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:14,868 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-06 13:22:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 2 times [2024-05-06 13:22:14,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:14,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 1 times [2024-05-06 13:22:15,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 1 times [2024-05-06 13:22:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 1 times [2024-05-06 13:22:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash 652991947, now seen corresponding path program 2 times [2024-05-06 13:22:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:15,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:15,569 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-06 13:22:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:15,583 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-06 13:22:15,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-05-06 13:22:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 3 times [2024-05-06 13:22:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 2 times [2024-05-06 13:22:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 2 times [2024-05-06 13:22:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash 652991948, now seen corresponding path program 1 times [2024-05-06 13:22:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 1 times [2024-05-06 13:22:16,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash 23374588, now seen corresponding path program 1 times [2024-05-06 13:22:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1342244796, now seen corresponding path program 2 times [2024-05-06 13:22:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1407070656, now seen corresponding path program 2 times [2024-05-06 13:22:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:16,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 521659048, now seen corresponding path program 1 times [2024-05-06 13:22:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:17,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 1 times [2024-05-06 13:22:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:17,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 520583847, now seen corresponding path program 1 times [2024-05-06 13:22:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:18,044 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-06 13:22:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:18,060 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-06 13:22:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2024-05-06 13:22:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 4 times [2024-05-06 13:22:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 3 times [2024-05-06 13:22:18,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 3 times [2024-05-06 13:22:18,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash 652991948, now seen corresponding path program 2 times [2024-05-06 13:22:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 3 times [2024-05-06 13:22:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 23374588, now seen corresponding path program 3 times [2024-05-06 13:22:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:18,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1342244796, now seen corresponding path program 4 times [2024-05-06 13:22:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1407070656, now seen corresponding path program 4 times [2024-05-06 13:22:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 521659048, now seen corresponding path program 2 times [2024-05-06 13:22:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 2 times [2024-05-06 13:22:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 520583848, now seen corresponding path program 3 times [2024-05-06 13:22:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2064882058, now seen corresponding path program 3 times [2024-05-06 13:22:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -413165285, now seen corresponding path program 1 times [2024-05-06 13:22:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 13:22:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:19,880 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-06 13:22:19,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:19,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2024-05-06 13:22:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 5 times [2024-05-06 13:22:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:20,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 4 times [2024-05-06 13:22:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:20,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 4 times [2024-05-06 13:22:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:20,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1809995054, now seen corresponding path program 1 times [2024-05-06 13:22:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:22,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1752067378, now seen corresponding path program 1 times [2024-05-06 13:22:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:22,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 109580726, now seen corresponding path program 1 times [2024-05-06 13:22:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:22,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1827261415, now seen corresponding path program 1 times [2024-05-06 13:22:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:23,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1529624573, now seen corresponding path program 1 times [2024-05-06 13:22:23,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:23,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1090409921, now seen corresponding path program 1 times [2024-05-06 13:22:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:23,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1160707340, now seen corresponding path program 1 times [2024-05-06 13:22:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:25,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash 149653968, now seen corresponding path program 1 times [2024-05-06 13:22:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:25,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2083552980, now seen corresponding path program 1 times [2024-05-06 13:22:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:25,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:25,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash -691870107, now seen corresponding path program 1 times [2024-05-06 13:22:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:26,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 26863515, now seen corresponding path program 6 times [2024-05-06 13:22:27,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:27,098 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-06 13:22:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:27,121 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-06 13:22:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:27,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2024-05-06 13:22:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -433211570, now seen corresponding path program 1 times [2024-05-06 13:22:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:37,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash -876939014, now seen corresponding path program 1 times [2024-05-06 13:22:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:38,815 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-06 13:22:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:38,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-06 13:22:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:22:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2024-05-06 13:22:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:50,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 13:22:50,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 13:22:50,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 13:22:50,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 13:22:50,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-06 13:22:50,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 13:22:50,985 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-06 13:22:51,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,SelfDestructingSolverStorable32,SelfDestructingSolverStorable76,SelfDestructingSolverStorable33,SelfDestructingSolverStorable77,SelfDestructingSolverStorable34,SelfDestructingSolverStorable78,SelfDestructingSolverStorable35,SelfDestructingSolverStorable79,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable40,SelfDestructingSolverStorable84,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 13:22:51,188 INFO L448 BasicCegarLoop]: Path program histogram: [6, 5, 4, 4, 4, 4, 3, 3, 2, 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] [2024-05-06 13:22:51,191 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 13:22:51,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 13:22:51,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 01:22:51 BasicIcfg [2024-05-06 13:22:51,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 13:22:51,194 INFO L158 Benchmark]: Toolchain (without parser) took 41063.99ms. Allocated memory was 282.1MB in the beginning and 1.0GB in the end (delta: 726.7MB). Free memory was 209.1MB in the beginning and 762.1MB in the end (delta: -553.0MB). Peak memory consumption was 174.2MB. Max. memory is 8.0GB. [2024-05-06 13:22:51,194 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 282.1MB. Free memory is still 248.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 13:22:51,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.30ms. Allocated memory is still 282.1MB. Free memory was 208.9MB in the beginning and 188.1MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-06 13:22:51,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 282.1MB. Free memory was 188.1MB in the beginning and 186.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 13:22:51,195 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 282.1MB. Free memory was 186.2MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 13:22:51,195 INFO L158 Benchmark]: RCFGBuilder took 433.56ms. Allocated memory is still 282.1MB. Free memory was 184.5MB in the beginning and 241.9MB in the end (delta: -57.3MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2024-05-06 13:22:51,196 INFO L158 Benchmark]: TraceAbstraction took 40057.69ms. Allocated memory was 282.1MB in the beginning and 1.0GB in the end (delta: 726.7MB). Free memory was 240.3MB in the beginning and 762.1MB in the end (delta: -521.8MB). Peak memory consumption was 204.9MB. Max. memory is 8.0GB. [2024-05-06 13:22:51,198 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 282.1MB. Free memory is still 248.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 487.30ms. Allocated memory is still 282.1MB. Free memory was 208.9MB in the beginning and 188.1MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 282.1MB. Free memory was 188.1MB in the beginning and 186.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 282.1MB. Free memory was 186.2MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 433.56ms. Allocated memory is still 282.1MB. Free memory was 184.5MB in the beginning and 241.9MB in the end (delta: -57.3MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. * TraceAbstraction took 40057.69ms. Allocated memory was 282.1MB in the beginning and 1.0GB in the end (delta: 726.7MB). Free memory was 240.3MB in the beginning and 762.1MB in the end (delta: -521.8MB). Peak memory consumption was 204.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 44239, independent: 39811, independent conditional: 39654, independent unconditional: 157, dependent: 4428, dependent conditional: 4425, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41843, independent: 39811, independent conditional: 39654, independent unconditional: 157, dependent: 2032, dependent conditional: 2029, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41843, independent: 39811, independent conditional: 39654, independent unconditional: 157, dependent: 2032, dependent conditional: 2029, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41843, independent: 39811, independent conditional: 39654, independent unconditional: 157, dependent: 2032, dependent conditional: 2029, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50350, independent: 39811, independent conditional: 17502, independent unconditional: 22309, dependent: 10539, dependent conditional: 8511, dependent unconditional: 2028, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50350, independent: 39811, independent conditional: 15074, independent unconditional: 24737, dependent: 10539, dependent conditional: 4498, dependent unconditional: 6041, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50350, independent: 39811, independent conditional: 15074, independent unconditional: 24737, dependent: 10539, dependent conditional: 4498, dependent unconditional: 6041, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2102, independent: 1759, independent conditional: 454, independent unconditional: 1305, dependent: 343, dependent conditional: 263, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2102, independent: 1759, independent conditional: 0, independent unconditional: 1759, dependent: 343, dependent conditional: 0, dependent unconditional: 343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 343, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 343, dependent conditional: 263, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 343, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 343, dependent conditional: 263, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 301, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 301, dependent conditional: 204, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 50350, independent: 38052, independent conditional: 14620, independent unconditional: 23432, dependent: 10196, dependent conditional: 4235, dependent unconditional: 5961, unknown: 2102, unknown conditional: 717, unknown unconditional: 1385] , Statistics on independence cache: Total cache size (in pairs): 2102, Positive cache size: 1759, Positive conditional cache size: 454, Positive unconditional cache size: 1305, Negative cache size: 343, Negative conditional cache size: 263, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6441, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50350, independent: 39811, independent conditional: 17502, independent unconditional: 22309, dependent: 10539, dependent conditional: 8511, dependent unconditional: 2028, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50350, independent: 39811, independent conditional: 15074, independent unconditional: 24737, dependent: 10539, dependent conditional: 4498, dependent unconditional: 6041, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50350, independent: 39811, independent conditional: 15074, independent unconditional: 24737, dependent: 10539, dependent conditional: 4498, dependent unconditional: 6041, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2102, independent: 1759, independent conditional: 454, independent unconditional: 1305, dependent: 343, dependent conditional: 263, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2102, independent: 1759, independent conditional: 0, independent unconditional: 1759, dependent: 343, dependent conditional: 0, dependent unconditional: 343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 343, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 343, dependent conditional: 263, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 343, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 343, dependent conditional: 263, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 301, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 301, dependent conditional: 204, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 50350, independent: 38052, independent conditional: 14620, independent unconditional: 23432, dependent: 10196, dependent conditional: 4235, dependent unconditional: 5961, unknown: 2102, unknown conditional: 717, unknown unconditional: 1385] , Statistics on independence cache: Total cache size (in pairs): 2102, Positive cache size: 1759, Positive conditional cache size: 454, Positive unconditional cache size: 1305, Negative cache size: 343, Negative conditional cache size: 263, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6441 ], Independence queries for same thread: 2396 - 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: 39.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 39.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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.0s 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: 36.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 10, ConditionalCommutativityConditionCalculations: 953, ConditionalCommutativityTraceChecks: 64, ConditionalCommutativityImperfectProofs: 9 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 13:22:51,213 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-06 13:22:51,423 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...