/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:02:01,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:02:01,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:02:01,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:02:01,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:02:01,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:02:01,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:02:01,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:02:01,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:02:01,400 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:02:01,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:02:01,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:02:01,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:02:01,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:02:01,417 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:02:01,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:02:01,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:02:01,417 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:02:01,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:02:01,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:02:01,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:02:01,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:02:01,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:02:01,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:02:01,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:02:01,420 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:02:01,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:02:01,420 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:02:01,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:02:01,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:02:01,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:02:01,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:02:01,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:02:01,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:02:01,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:02:01,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:02:01,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:02:01,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:02:01,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:02:01,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:02:01,422 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:02:01,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:02:01,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:02:01,424 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 22:02:01,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:02:01,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:02:01,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:02:01,741 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:02:01,742 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:02:01,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i [2023-12-15 22:02:02,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:02:03,100 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:02:03,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i [2023-12-15 22:02:03,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e636bc10a/61bb747da31f4e8ca9932dcc7d386b5d/FLAG9c0ae0afd [2023-12-15 22:02:03,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e636bc10a/61bb747da31f4e8ca9932dcc7d386b5d [2023-12-15 22:02:03,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:02:03,117 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:02:03,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:02:03,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:02:03,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:02:03,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4710d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03, skipping insertion in model container [2023-12-15 22:02:03,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:02:03,223 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i[804,817] [2023-12-15 22:02:03,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:02:03,237 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:02:03,246 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i[804,817] [2023-12-15 22:02:03,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:02:03,259 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:02:03,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03 WrapperNode [2023-12-15 22:02:03,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:02:03,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:02:03,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:02:03,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:02:03,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,287 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2023-12-15 22:02:03,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:02:03,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:02:03,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:02:03,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:02:03,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 22:02:03,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:02:03,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:02:03,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:02:03,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:02:03,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (1/1) ... [2023-12-15 22:02:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:02:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:02:03,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 22:02:03,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 22:02:03,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:02:03,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:02:03,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:02:03,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:02:03,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-15 22:02:03,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-15 22:02:03,399 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:02:03,400 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:02:03,530 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:02:03,550 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:02:03,550 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 22:02:03,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:02:03 BoogieIcfgContainer [2023-12-15 22:02:03,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:02:03,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:02:03,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:02:03,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:02:03,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:02:03" (1/3) ... [2023-12-15 22:02:03,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772eafc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:02:03, skipping insertion in model container [2023-12-15 22:02:03,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:02:03" (2/3) ... [2023-12-15 22:02:03,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772eafc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:02:03, skipping insertion in model container [2023-12-15 22:02:03,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:02:03" (3/3) ... [2023-12-15 22:02:03,556 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2023-12-15 22:02:03,568 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:02:03,569 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:02:03,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:02:03,610 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=PETRI_NET, 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;@5ba1388b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:02:03,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:02:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 22:02:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 22:02:03,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:03,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:03,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:03,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:03,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1998107271, now seen corresponding path program 1 times [2023-12-15 22:02:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822000577] [2023-12-15 22:02:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:02:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822000577] [2023-12-15 22:02:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822000577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:02:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959072990] [2023-12-15 22:02:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:02:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:02:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:02:03,812 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:02:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:03,839 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2023-12-15 22:02:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:02:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-15 22:02:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:03,846 INFO L225 Difference]: With dead ends: 40 [2023-12-15 22:02:03,846 INFO L226 Difference]: Without dead ends: 19 [2023-12-15 22:02:03,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:02:03,850 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:03,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:02:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-15 22:02:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-15 22:02:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 22:02:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2023-12-15 22:02:03,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 7 [2023-12-15 22:02:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:03,878 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-12-15 22:02:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:02:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2023-12-15 22:02:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 22:02:03,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:03,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:03,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:02:03,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:03,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1996498557, now seen corresponding path program 1 times [2023-12-15 22:02:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700672721] [2023-12-15 22:02:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:02:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700672721] [2023-12-15 22:02:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700672721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:04,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:02:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215881317] [2023-12-15 22:02:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:02:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:02:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:02:04,009 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:02:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:04,086 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-12-15 22:02:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:02:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-15 22:02:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:04,087 INFO L225 Difference]: With dead ends: 25 [2023-12-15 22:02:04,087 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 22:02:04,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:02:04,088 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:04,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:02:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 22:02:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-15 22:02:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 22:02:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-12-15 22:02:04,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 7 [2023-12-15 22:02:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:04,099 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-12-15 22:02:04,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:02:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-12-15 22:02:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 22:02:04,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:04,099 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:04,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:02:04,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:04,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2106031398, now seen corresponding path program 1 times [2023-12-15 22:02:04,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179413132] [2023-12-15 22:02:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:02:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:02:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179413132] [2023-12-15 22:02:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179413132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:02:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569301928] [2023-12-15 22:02:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:04,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:02:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:02:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:02:04,215 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:02:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:04,326 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-12-15 22:02:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:02:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-15 22:02:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:04,328 INFO L225 Difference]: With dead ends: 41 [2023-12-15 22:02:04,328 INFO L226 Difference]: Without dead ends: 39 [2023-12-15 22:02:04,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:02:04,330 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:04,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:02:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-15 22:02:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-12-15 22:02:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 22:02:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2023-12-15 22:02:04,343 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 12 [2023-12-15 22:02:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:04,343 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2023-12-15 22:02:04,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:02:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2023-12-15 22:02:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-15 22:02:04,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:04,344 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:02:04,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:04,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2121220317, now seen corresponding path program 1 times [2023-12-15 22:02:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324564124] [2023-12-15 22:02:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:02:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:02:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:02:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324564124] [2023-12-15 22:02:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324564124] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:02:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587130417] [2023-12-15 22:02:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:02:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:02:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:02:04,486 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:02:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:04,578 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-12-15 22:02:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:02:04,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-15 22:02:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:04,581 INFO L225 Difference]: With dead ends: 45 [2023-12-15 22:02:04,581 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 22:02:04,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:02:04,585 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:04,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:02:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 22:02:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-12-15 22:02:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 22:02:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-12-15 22:02:04,600 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 17 [2023-12-15 22:02:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:04,600 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-12-15 22:02:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:02:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-12-15 22:02:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 22:02:04,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:04,602 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:04,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:02:04,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:04,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 905923334, now seen corresponding path program 1 times [2023-12-15 22:02:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752271902] [2023-12-15 22:02:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:02:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:02:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:02:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:02:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752271902] [2023-12-15 22:02:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752271902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:04,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:04,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:02:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113514436] [2023-12-15 22:02:04,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:04,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:02:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:04,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:02:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:02:04,693 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 22:02:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:04,758 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2023-12-15 22:02:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:02:04,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2023-12-15 22:02:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:04,762 INFO L225 Difference]: With dead ends: 88 [2023-12-15 22:02:04,762 INFO L226 Difference]: Without dead ends: 55 [2023-12-15 22:02:04,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:02:04,764 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:04,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:02:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-15 22:02:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-15 22:02:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 22:02:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2023-12-15 22:02:04,775 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 22 [2023-12-15 22:02:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:04,775 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2023-12-15 22:02:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 22:02:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2023-12-15 22:02:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-15 22:02:04,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:04,786 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-15 22:02:04,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:02:04,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:04,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1205745070, now seen corresponding path program 1 times [2023-12-15 22:02:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961117069] [2023-12-15 22:02:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:02:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:02:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:02:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:02:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 22:02:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 22:02:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:02:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-15 22:02:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961117069] [2023-12-15 22:02:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961117069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:02:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177734572] [2023-12-15 22:02:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:04,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:02:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:02:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:02:04,938 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-15 22:02:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:04,988 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2023-12-15 22:02:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 22:02:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2023-12-15 22:02:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:04,991 INFO L225 Difference]: With dead ends: 61 [2023-12-15 22:02:04,991 INFO L226 Difference]: Without dead ends: 59 [2023-12-15 22:02:04,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:02:04,995 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:04,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:02:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-15 22:02:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-15 22:02:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 22:02:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2023-12-15 22:02:05,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 43 [2023-12-15 22:02:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:05,016 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2023-12-15 22:02:05,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-15 22:02:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2023-12-15 22:02:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-15 22:02:05,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:05,017 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:05,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:02:05,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:05,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash 296191259, now seen corresponding path program 1 times [2023-12-15 22:02:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274266059] [2023-12-15 22:02:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:02:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:02:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:02:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:02:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 22:02:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 22:02:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:02:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 22:02:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:02:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:02:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:02:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:02:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:02:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 22:02:05,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274266059] [2023-12-15 22:02:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274266059] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:02:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223851432] [2023-12-15 22:02:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:05,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:02:05,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:02:05,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:02:05,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:02:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:05,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-15 22:02:05,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:02:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 22:02:05,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:02:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 22:02:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223851432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:02:05,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:02:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2023-12-15 22:02:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117945994] [2023-12-15 22:02:05,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:02:05,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-15 22:02:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-15 22:02:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:02:05,883 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-15 22:02:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:06,087 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2023-12-15 22:02:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:02:06,087 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 77 [2023-12-15 22:02:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:06,088 INFO L225 Difference]: With dead ends: 79 [2023-12-15 22:02:06,088 INFO L226 Difference]: Without dead ends: 77 [2023-12-15 22:02:06,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2023-12-15 22:02:06,089 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:06,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 259 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 22:02:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-15 22:02:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2023-12-15 22:02:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 22:02:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2023-12-15 22:02:06,099 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 77 [2023-12-15 22:02:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:06,100 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2023-12-15 22:02:06,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-15 22:02:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2023-12-15 22:02:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-15 22:02:06,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:02:06,102 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:06,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 22:02:06,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:02:06,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:02:06,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:02:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 359688270, now seen corresponding path program 2 times [2023-12-15 22:02:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:02:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948771449] [2023-12-15 22:02:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:02:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:02:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:02:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:02:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:02:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:02:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 22:02:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 22:02:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:02:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 22:02:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:02:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:02:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:02:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:02:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:02:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:02:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:02:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2023-12-15 22:02:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:02:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948771449] [2023-12-15 22:02:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948771449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:02:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:02:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:02:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603004189] [2023-12-15 22:02:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:02:06,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:02:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:02:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:02:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:02:06,438 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 22:02:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:02:06,480 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2023-12-15 22:02:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:02:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2023-12-15 22:02:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:02:06,481 INFO L225 Difference]: With dead ends: 67 [2023-12-15 22:02:06,481 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 22:02:06,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:02:06,482 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:02:06,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 67 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:02:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 22:02:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 22:02:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-12-15 22:02:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 22:02:06,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-12-15 22:02:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:02:06,483 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 22:02:06,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 22:02:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 22:02:06,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 22:02:06,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:02:06,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:02:06,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 22:02:06,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 22:02:06,783 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-15 22:02:06,783 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (<= 3 |ULTIMATE.start_main_~j~0#1|) .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)))) [2023-12-15 22:02:06,783 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse0 (= |ULTIMATE.start_main_~j~0#1| .cse1) (<= 2 |ULTIMATE.start_main_~i~0#1|)))) [2023-12-15 22:02:06,783 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse0 (= |ULTIMATE.start_main_~j~0#1| .cse1) (<= 2 |ULTIMATE.start_main_~i~0#1|)))) [2023-12-15 22:02:06,783 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse0 (= |ULTIMATE.start_main_~j~0#1| .cse1) (<= 2 |ULTIMATE.start_main_~i~0#1|)))) [2023-12-15 22:02:06,783 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 22:02:06,784 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= 3 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 4) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~i~0#1|)) [2023-12-15 22:02:06,784 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~j~0#1| .cse1) (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (<= 3 |ULTIMATE.start_main_~j~0#1|) .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)))) [2023-12-15 22:02:06,784 INFO L895 garLoopResultBuilder]: At program point L24(lines 18 25) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~j~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0) (and .cse1 (<= .cse2 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse2)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 3) .cse0) (and .cse1 (= |ULTIMATE.start_main_~j~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~i~0#1|)))) [2023-12-15 22:02:06,784 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1)) (and .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse0 (= |ULTIMATE.start_main_~j~0#1| .cse1) (<= 2 |ULTIMATE.start_main_~i~0#1|)))) [2023-12-15 22:02:06,784 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 18 25) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~j~0#1| .cse1) (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (<= 3 |ULTIMATE.start_main_~j~0#1|) .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)))) [2023-12-15 22:02:06,784 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 31) the Hoare annotation is: (or (< 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0)) [2023-12-15 22:02:06,784 INFO L899 garLoopResultBuilder]: For program point L16-3(lines 16 31) no Hoare annotation was computed. [2023-12-15 22:02:06,784 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-15 22:02:06,784 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-12-15 22:02:06,784 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-12-15 22:02:06,784 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-12-15 22:02:06,784 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-12-15 22:02:06,784 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-15 22:02:06,786 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-12-15 22:02:06,788 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:02:06,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:02:06 BoogieIcfgContainer [2023-12-15 22:02:06,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:02:06,806 INFO L158 Benchmark]: Toolchain (without parser) took 3689.86ms. Allocated memory is still 247.5MB. Free memory was 192.9MB in the beginning and 157.9MB in the end (delta: 35.0MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2023-12-15 22:02:06,806 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:02:06,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.17ms. Allocated memory is still 247.5MB. Free memory was 192.4MB in the beginning and 181.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 22:02:06,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.86ms. Allocated memory is still 247.5MB. Free memory was 181.9MB in the beginning and 180.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:02:06,807 INFO L158 Benchmark]: Boogie Preprocessor took 21.82ms. Allocated memory is still 247.5MB. Free memory was 180.3MB in the beginning and 178.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 22:02:06,807 INFO L158 Benchmark]: RCFGBuilder took 239.64ms. Allocated memory is still 247.5MB. Free memory was 178.8MB in the beginning and 168.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 22:02:06,807 INFO L158 Benchmark]: TraceAbstraction took 3254.31ms. Allocated memory is still 247.5MB. Free memory was 167.7MB in the beginning and 157.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2023-12-15 22:02:06,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 142.17ms. Allocated memory is still 247.5MB. Free memory was 192.4MB in the beginning and 181.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.86ms. Allocated memory is still 247.5MB. Free memory was 181.9MB in the beginning and 180.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.82ms. Allocated memory is still 247.5MB. Free memory was 180.3MB in the beginning and 178.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 239.64ms. Allocated memory is still 247.5MB. Free memory was 178.8MB in the beginning and 168.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3254.31ms. Allocated memory is still 247.5MB. Free memory was 167.7MB in the beginning and 157.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: 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 CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 757 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 570 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 187 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 52 PreInvPairs, 83 NumberOfFragments, 349 HoareAnnotationTreeSize, 52 FormulaSimplifications, 650 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FormulaSimplificationsInter, 112 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 1 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1573/1599 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((2 == j) && (i == 1)) || ((i == 0) && (j == 0))) || ((((j <= 4) && ((2 * i) <= (6 + j))) && (2 <= j)) && ((2 + j) <= (2 * i)))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((j <= 4) && (j == (2 * i))) && (2 <= i))) RESULT: Ultimate proved your program to be correct! [2023-12-15 22:02:06,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...