/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 FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 23:30:48,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 23:30:48,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 23:30:48,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 23:30:48,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 23:30:48,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 23:30:48,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 23:30:48,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 23:30:48,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 23:30:48,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 23:30:48,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 23:30:48,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 23:30:48,121 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 23:30:48,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 23:30:48,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 23:30:48,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 23:30:48,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 23:30:48,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 23:30:48,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 23:30:48,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 23:30:48,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 23:30:48,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 23:30:48,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 23:30:48,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 23:30:48,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 23:30:48,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 23:30:48,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 23:30:48,125 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 23:30:48,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 23:30:48,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 23:30:48,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 23:30:48,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 23:30:48,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 23:30:48,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 23:30:48,127 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 23:30:48,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 23:30:48,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 23:30:48,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 23:30:48,128 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 23:30:48,128 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 -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 23:30:48,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 23:30:48,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 23:30:48,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 23:30:48,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 23:30:48,345 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 23:30:48,346 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 23:30:49,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 23:30:49,552 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 23:30:49,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-06 23:30:49,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b42cc174d/c09decfa657a4b6b9187a28d47a909bb/FLAG63a7d338c [2024-05-06 23:30:49,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b42cc174d/c09decfa657a4b6b9187a28d47a909bb [2024-05-06 23:30:49,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 23:30:49,577 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 23:30:49,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 23:30:49,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 23:30:49,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 23:30:49,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:30:49" (1/1) ... [2024-05-06 23:30:49,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96dbd23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:49, skipping insertion in model container [2024-05-06 23:30:49,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:30:49" (1/1) ... [2024-05-06 23:30:49,650 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 23:30:49,920 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 23:30:49,925 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 23:30:49,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 23:30:49,939 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 23:30:49,970 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 23:30:49,972 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 23:30:49,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 23:30:50,039 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 23:30:50,039 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 23:30:50,050 INFO L206 MainTranslator]: Completed translation [2024-05-06 23:30:50,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50 WrapperNode [2024-05-06 23:30:50,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 23:30:50,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 23:30:50,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 23:30:50,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 23:30:50,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,164 INFO L138 Inliner]: procedures = 170, calls = 74, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2024-05-06 23:30:50,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 23:30:50,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 23:30:50,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 23:30:50,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 23:30:50,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 23:30:50,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 23:30:50,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 23:30:50,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 23:30:50,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (1/1) ... [2024-05-06 23:30:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 23:30:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:30:50,257 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 23:30:50,274 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 23:30:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 23:30:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-06 23:30:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-06 23:30:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-06 23:30:50,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-06 23:30:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 23:30:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 23:30:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 23:30:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 23:30:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 23:30:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 23:30:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 23:30:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 23:30:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 23:30:50,298 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 23:30:50,404 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 23:30:50,405 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 23:30:50,541 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 23:30:50,548 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 23:30:50,549 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2024-05-06 23:30:50,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:30:50 BoogieIcfgContainer [2024-05-06 23:30:50,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 23:30:50,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 23:30:50,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 23:30:50,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 23:30:50,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:30:49" (1/3) ... [2024-05-06 23:30:50,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97242d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:30:50, skipping insertion in model container [2024-05-06 23:30:50,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:30:50" (2/3) ... [2024-05-06 23:30:50,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97242d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:30:50, skipping insertion in model container [2024-05-06 23:30:50,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:30:50" (3/3) ... [2024-05-06 23:30:50,556 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-05-06 23:30:50,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 23:30:50,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 23:30:50,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 23:30:50,569 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 23:30:50,624 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 23:30:50,689 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 23:30:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 23:30:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:30:50,692 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 23:30:50,693 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 23:30:50,736 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 23:30:50,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:30:50,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 23:30:50,752 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;@599ca069, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 23:30:50,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 23:30:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 623440169, now seen corresponding path program 1 times [2024-05-06 23:30:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,180 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 23:30:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,282 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 23:30:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 23:30:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 23:30:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash 645532603, now seen corresponding path program 1 times [2024-05-06 23:30:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,486 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 23:30:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,550 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 23:30:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 23:30:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 23:30:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash -521405355, now seen corresponding path program 1 times [2024-05-06 23:30:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,708 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 23:30:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,786 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 23:30:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 23:30:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-05-06 23:30:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 1 times [2024-05-06 23:30:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:51,988 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 23:30:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,048 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 23:30:52,068 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 23:30:52,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:30:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1561719619, now seen corresponding path program 1 times [2024-05-06 23:30:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:30:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754600144] [2024-05-06 23:30:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,125 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 23:30:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:30:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754600144] [2024-05-06 23:30:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754600144] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:30:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738616842] [2024-05-06 23:30:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:30:52,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:30:52,158 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 23:30:52,188 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 23:30:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-06 23:30:52,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:30:52,305 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 23:30:52,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 23:30:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738616842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:30:52,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 23:30:52,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-06 23:30:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457893200] [2024-05-06 23:30:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:30:52,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 23:30:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:30:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 23:30:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 23:30:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:30:52,314 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:30:52,316 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 23:30:52,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:30:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 2 times [2024-05-06 23:30:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,440 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 23:30:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,467 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 23:30:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:30:52,524 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 23:30:52,716 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 23:30:52,717 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 23:30:52,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:30:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash -214652225, now seen corresponding path program 1 times [2024-05-06 23:30:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:30:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583970964] [2024-05-06 23:30:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,780 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 23:30:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:30:52,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583970964] [2024-05-06 23:30:52,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583970964] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:30:52,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704024078] [2024-05-06 23:30:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:30:52,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:30:52,804 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 23:30:52,844 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 23:30:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:52,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-06 23:30:52,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:30:52,914 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 23:30:52,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 23:30:52,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704024078] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:30:52,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 23:30:52,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-06 23:30:52,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638493744] [2024-05-06 23:30:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:30:52,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 23:30:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:30:52,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 23:30:52,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 23:30:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:30:52,922 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:30:52,922 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 23:30:52,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:30:52,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:30:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 3 times [2024-05-06 23:30:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:53,022 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 23:30:53,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:53,055 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 23:30:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1007501233, now seen corresponding path program 1 times [2024-05-06 23:30:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:53,278 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 23:30:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:53,322 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 23:30:53,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:30:53,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-05-06 23:30:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 1 times [2024-05-06 23:30:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 4 times [2024-05-06 23:30:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:53,651 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 23:30:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:53,673 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 23:30:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 1 times [2024-05-06 23:30:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 991567198, now seen corresponding path program 1 times [2024-05-06 23:30:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash -586650568, now seen corresponding path program 1 times [2024-05-06 23:30:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1006298031, now seen corresponding path program 1 times [2024-05-06 23:30:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,020 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 23:30:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,044 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 23:30:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -684754539, now seen corresponding path program 1 times [2024-05-06 23:30:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:30:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,128 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 23:30:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash -919102792, now seen corresponding path program 1 times [2024-05-06 23:30:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,190 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 23:30:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,213 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 23:30:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1505491961, now seen corresponding path program 1 times [2024-05-06 23:30:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,274 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 23:30:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,294 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 23:30:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash 991609979, now seen corresponding path program 1 times [2024-05-06 23:30:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,423 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 23:30:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,456 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 23:30:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:30:54,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-05-06 23:30:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 2 times [2024-05-06 23:30:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:54,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 5 times [2024-05-06 23:30:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,670 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 23:30:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:54,696 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 23:30:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 2 times [2024-05-06 23:30:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:54,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 1 times [2024-05-06 23:30:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 1 times [2024-05-06 23:30:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 1 times [2024-05-06 23:30:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash 652991947, now seen corresponding path program 2 times [2024-05-06 23:30:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:55,433 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 23:30:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:55,452 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 23:30:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:30:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-05-06 23:30:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 3 times [2024-05-06 23:30:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 2 times [2024-05-06 23:30:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:55,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 2 times [2024-05-06 23:30:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash 652991948, now seen corresponding path program 1 times [2024-05-06 23:30:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 1 times [2024-05-06 23:30:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1342244796, now seen corresponding path program 2 times [2024-05-06 23:30:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:56,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 521659048, now seen corresponding path program 1 times [2024-05-06 23:30:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 1 times [2024-05-06 23:30:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash 520583847, now seen corresponding path program 1 times [2024-05-06 23:30:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:57,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:57,594 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 23:30:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:57,610 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 23:30:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:30:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2024-05-06 23:30:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 4 times [2024-05-06 23:30:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 3 times [2024-05-06 23:30:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:57,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,005 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 3 times [2024-05-06 23:30:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash 652991948, now seen corresponding path program 2 times [2024-05-06 23:30:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 3 times [2024-05-06 23:30:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1342244796, now seen corresponding path program 4 times [2024-05-06 23:30:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 521659048, now seen corresponding path program 2 times [2024-05-06 23:30:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 2 times [2024-05-06 23:30:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash 520583848, now seen corresponding path program 3 times [2024-05-06 23:30:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2064882058, now seen corresponding path program 3 times [2024-05-06 23:30:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:58,915 INFO L85 PathProgramCache]: Analyzing trace with hash -413165285, now seen corresponding path program 1 times [2024-05-06 23:30:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:58,952 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 23:30:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:30:58,968 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 23:30:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:30:58,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2024-05-06 23:30:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 5 times [2024-05-06 23:30:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:59,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 4 times [2024-05-06 23:30:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:59,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 4 times [2024-05-06 23:30:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:30:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:30:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:30:59,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:30:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1809995054, now seen corresponding path program 1 times [2024-05-06 23:31:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:00,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1752067378, now seen corresponding path program 1 times [2024-05-06 23:31:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:00,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 109580726, now seen corresponding path program 1 times [2024-05-06 23:31:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:00,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1827261415, now seen corresponding path program 1 times [2024-05-06 23:31:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1529624573, now seen corresponding path program 1 times [2024-05-06 23:31:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1090409921, now seen corresponding path program 1 times [2024-05-06 23:31:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1160707340, now seen corresponding path program 1 times [2024-05-06 23:31:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash 149653968, now seen corresponding path program 1 times [2024-05-06 23:31:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:01,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2083552980, now seen corresponding path program 1 times [2024-05-06 23:31:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:02,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash -691870107, now seen corresponding path program 1 times [2024-05-06 23:31:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:02,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 26863515, now seen corresponding path program 6 times [2024-05-06 23:31:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:31:02,696 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 23:31:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:31:02,710 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 23:31:02,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:31:02,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2024-05-06 23:31:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash -433211570, now seen corresponding path program 1 times [2024-05-06 23:31:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:06,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:31:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:31:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -876939014, now seen corresponding path program 1 times [2024-05-06 23:31:06,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:31:06,888 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 23:31:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:31:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:31:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:31:06,909 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 23:31:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 23:31:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2024-05-06 23:31:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:31:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:31:09,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 23:31:09,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 23:31:09,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 23:31:09,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 23:31:09,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-06 23:31:09,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 23:31:09,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-06 23:31:09,977 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,SelfDestructingSolverStorable40,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 23:31:09,994 INFO L448 BasicCegarLoop]: Path program histogram: [6, 5, 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 23:31:09,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 23:31:09,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 23:31:10,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:31:10 BasicIcfg [2024-05-06 23:31:10,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 23:31:10,001 INFO L158 Benchmark]: Toolchain (without parser) took 20424.06ms. Allocated memory was 163.6MB in the beginning and 817.9MB in the end (delta: 654.3MB). Free memory was 93.6MB in the beginning and 454.8MB in the end (delta: -361.2MB). Peak memory consumption was 295.1MB. Max. memory is 8.0GB. [2024-05-06 23:31:10,002 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 163.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 23:31:10,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.50ms. Allocated memory was 163.6MB in the beginning and 321.9MB in the end (delta: 158.3MB). Free memory was 93.5MB in the beginning and 289.5MB in the end (delta: -196.0MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. [2024-05-06 23:31:10,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.37ms. Allocated memory is still 321.9MB. Free memory was 289.5MB in the beginning and 287.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 23:31:10,010 INFO L158 Benchmark]: Boogie Preprocessor took 45.21ms. Allocated memory is still 321.9MB. Free memory was 287.5MB in the beginning and 285.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 23:31:10,011 INFO L158 Benchmark]: RCFGBuilder took 338.76ms. Allocated memory is still 321.9MB. Free memory was 285.9MB in the beginning and 270.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-06 23:31:10,011 INFO L158 Benchmark]: TraceAbstraction took 19448.78ms. Allocated memory was 321.9MB in the beginning and 817.9MB in the end (delta: 496.0MB). Free memory was 268.6MB in the beginning and 454.8MB in the end (delta: -186.2MB). Peak memory consumption was 310.3MB. Max. memory is 8.0GB. [2024-05-06 23:31:10,013 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.08ms. Allocated memory is still 163.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.50ms. Allocated memory was 163.6MB in the beginning and 321.9MB in the end (delta: 158.3MB). Free memory was 93.5MB in the beginning and 289.5MB in the end (delta: -196.0MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 113.37ms. Allocated memory is still 321.9MB. Free memory was 289.5MB in the beginning and 287.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.21ms. Allocated memory is still 321.9MB. Free memory was 287.5MB in the beginning and 285.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 338.76ms. Allocated memory is still 321.9MB. Free memory was 285.9MB in the beginning and 270.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19448.78ms. Allocated memory was 321.9MB in the beginning and 817.9MB in the end (delta: 496.0MB). Free memory was 268.6MB in the beginning and 454.8MB in the end (delta: -186.2MB). Peak memory consumption was 310.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45581, independent: 40832, independent conditional: 40675, independent unconditional: 157, dependent: 4749, dependent conditional: 4746, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42864, independent: 40832, independent conditional: 40675, 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: 42864, independent: 40832, independent conditional: 40675, 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: 42864, independent: 40832, independent conditional: 40675, 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: 51371, independent: 40832, independent conditional: 17502, independent unconditional: 23330, 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: 51371, independent: 40832, independent conditional: 15074, independent unconditional: 25758, 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: 51371, independent: 40832, independent conditional: 15074, independent unconditional: 25758, 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: 2084, independent: 1741, independent conditional: 433, independent unconditional: 1308, 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: 2084, independent: 1741, independent conditional: 0, independent unconditional: 1741, 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: 291, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 291, dependent conditional: 203, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 51371, independent: 39091, independent conditional: 14641, independent unconditional: 24450, dependent: 10196, dependent conditional: 4235, dependent unconditional: 5961, unknown: 2084, unknown conditional: 696, unknown unconditional: 1388] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 1741, Positive conditional cache size: 433, Positive unconditional cache size: 1308, 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: 51371, independent: 40832, independent conditional: 17502, independent unconditional: 23330, 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: 51371, independent: 40832, independent conditional: 15074, independent unconditional: 25758, 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: 51371, independent: 40832, independent conditional: 15074, independent unconditional: 25758, 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: 2084, independent: 1741, independent conditional: 433, independent unconditional: 1308, 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: 2084, independent: 1741, independent conditional: 0, independent unconditional: 1741, 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: 291, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 291, dependent conditional: 203, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 51371, independent: 39091, independent conditional: 14641, independent unconditional: 24450, dependent: 10196, dependent conditional: 4235, dependent unconditional: 5961, unknown: 2084, unknown conditional: 696, unknown unconditional: 1388] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 1741, Positive conditional cache size: 433, Positive unconditional cache size: 1308, 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: 2717 - 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: 19.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 18.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 50/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 16.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 10, ConditionalCommutativityConditionCalculations: 403, ConditionalCommutativityTraceChecks: 60, ConditionalCommutativityImperfectProofs: 9 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 23:31:10,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 23:31:10,238 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...