./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 19:05:19,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 19:05:19,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 19:05:19,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 19:05:19,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 19:05:19,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 19:05:19,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 19:05:19,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 19:05:19,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 19:05:19,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 19:05:19,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 19:05:19,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 19:05:19,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 19:05:19,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 19:05:19,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 19:05:19,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 19:05:19,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 19:05:19,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 19:05:19,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 19:05:19,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 19:05:19,786 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 19:05:19,786 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 19:05:19,787 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 19:05:19,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 19:05:19,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 19:05:19,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 19:05:19,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 19:05:19,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 19:05:19,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 19:05:19,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 19:05:19,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 19:05:19,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 19:05:19,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 19:05:19,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:05:19,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 19:05:19,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 19:05:19,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 19:05:19,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 19:05:19,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 19:05:19,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 19:05:19,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 19:05:19,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 19:05:19,792 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-11-22 19:05:19,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 19:05:20,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 19:05:20,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 19:05:20,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 19:05:20,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 19:05:20,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2024-11-22 19:05:21,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 19:05:21,492 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 19:05:21,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-11-22 19:05:21,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2877314b9/c75582893841431f8c9c49ec5536fbc1/FLAGa6d7d07c6 [2024-11-22 19:05:21,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2877314b9/c75582893841431f8c9c49ec5536fbc1 [2024-11-22 19:05:21,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 19:05:21,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 19:05:21,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 19:05:21,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 19:05:21,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 19:05:21,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f954ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21, skipping insertion in model container [2024-11-22 19:05:21,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 19:05:21,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:05:21,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 19:05:21,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:05:21,800 INFO L204 MainTranslator]: Completed translation [2024-11-22 19:05:21,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21 WrapperNode [2024-11-22 19:05:21,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 19:05:21,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 19:05:21,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 19:05:21,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 19:05:21,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,835 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2024-11-22 19:05:21,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 19:05:21,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 19:05:21,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 19:05:21,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 19:05:21,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,855 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]. [2024-11-22 19:05:21,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 19:05:21,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 19:05:21,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 19:05:21,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 19:05:21,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (1/1) ... [2024-11-22 19:05:21,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:05:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:05:21,898 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) [2024-11-22 19:05:21,900 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 [2024-11-22 19:05:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 19:05:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 19:05:21,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 19:05:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 19:05:21,973 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 19:05:21,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 19:05:22,207 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-22 19:05:22,208 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 19:05:22,223 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 19:05:22,224 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 19:05:22,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:22 BoogieIcfgContainer [2024-11-22 19:05:22,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 19:05:22,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 19:05:22,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 19:05:22,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 19:05:22,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:05:21" (1/3) ... [2024-11-22 19:05:22,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442ba388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:05:22, skipping insertion in model container [2024-11-22 19:05:22,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:21" (2/3) ... [2024-11-22 19:05:22,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442ba388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:05:22, skipping insertion in model container [2024-11-22 19:05:22,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:22" (3/3) ... [2024-11-22 19:05:22,236 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-11-22 19:05:22,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 19:05:22,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 19:05:22,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 19:05:22,294 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@54fed333, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 19:05:22,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 19:05:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 19:05:22,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:22,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 19:05:22,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash 28704014, now seen corresponding path program 1 times [2024-11-22 19:05:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138115980] [2024-11-22 19:05:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:22,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138115980] [2024-11-22 19:05:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138115980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:22,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:05:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139559524] [2024-11-22 19:05:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:22,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 19:05:22,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 19:05:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 19:05:22,504 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 45 states have internal predecessors, (81), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:22,519 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2024-11-22 19:05:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 19:05:22,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2024-11-22 19:05:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:22,530 INFO L225 Difference]: With dead ends: 45 [2024-11-22 19:05:22,530 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 19:05:22,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 19:05:22,535 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:22,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 19:05:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 19:05:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2024-11-22 19:05:22,611 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 5 [2024-11-22 19:05:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:22,611 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2024-11-22 19:05:22,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2024-11-22 19:05:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 19:05:22,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:22,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 19:05:22,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 19:05:22,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 889698510, now seen corresponding path program 1 times [2024-11-22 19:05:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338146080] [2024-11-22 19:05:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:22,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338146080] [2024-11-22 19:05:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338146080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:22,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:22,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:05:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806454831] [2024-11-22 19:05:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,675 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:22,682 INFO L93 Difference]: Finished difference Result 42 states and 74 transitions. [2024-11-22 19:05:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:22,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-11-22 19:05:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:22,683 INFO L225 Difference]: With dead ends: 42 [2024-11-22 19:05:22,683 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 19:05:22,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,684 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:22,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 19:05:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 19:05:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2024-11-22 19:05:22,689 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 72 transitions. Word has length 6 [2024-11-22 19:05:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:22,689 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 72 transitions. [2024-11-22 19:05:22,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 72 transitions. [2024-11-22 19:05:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 19:05:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:22,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 19:05:22,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1341606449, now seen corresponding path program 1 times [2024-11-22 19:05:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450416446] [2024-11-22 19:05:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450416446] [2024-11-22 19:05:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450416446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300265473] [2024-11-22 19:05:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:22,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,772 INFO L87 Difference]: Start difference. First operand 40 states and 72 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:22,795 INFO L93 Difference]: Finished difference Result 77 states and 139 transitions. [2024-11-22 19:05:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:22,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2024-11-22 19:05:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:22,796 INFO L225 Difference]: With dead ends: 77 [2024-11-22 19:05:22,796 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 19:05:22,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,798 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:22,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 19:05:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2024-11-22 19:05:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 95 transitions. [2024-11-22 19:05:22,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 95 transitions. Word has length 19 [2024-11-22 19:05:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 95 transitions. [2024-11-22 19:05:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 95 transitions. [2024-11-22 19:05:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 19:05:22,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:22,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 19:05:22,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 61742771, now seen corresponding path program 1 times [2024-11-22 19:05:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437832122] [2024-11-22 19:05:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:22,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437832122] [2024-11-22 19:05:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437832122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338595552] [2024-11-22 19:05:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:22,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:22,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:22,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:22,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,859 INFO L87 Difference]: Start difference. First operand 52 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:22,897 INFO L93 Difference]: Finished difference Result 77 states and 137 transitions. [2024-11-22 19:05:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:22,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2024-11-22 19:05:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:22,899 INFO L225 Difference]: With dead ends: 77 [2024-11-22 19:05:22,899 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 19:05:22,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,901 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:22,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 19:05:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-11-22 19:05:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2024-11-22 19:05:22,912 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 19 [2024-11-22 19:05:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:22,912 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 135 transitions. [2024-11-22 19:05:22,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2024-11-22 19:05:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:22,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:22,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:22,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 19:05:22,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1353275597, now seen corresponding path program 1 times [2024-11-22 19:05:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133100270] [2024-11-22 19:05:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:22,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:22,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133100270] [2024-11-22 19:05:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133100270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:22,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:22,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:22,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850267796] [2024-11-22 19:05:22,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:22,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:22,986 INFO L87 Difference]: Start difference. First operand 74 states and 135 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,003 INFO L93 Difference]: Finished difference Result 80 states and 139 transitions. [2024-11-22 19:05:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2024-11-22 19:05:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,004 INFO L225 Difference]: With dead ends: 80 [2024-11-22 19:05:23,004 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 19:05:23,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,008 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 19:05:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-22 19:05:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 137 transitions. [2024-11-22 19:05:23,022 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 137 transitions. Word has length 20 [2024-11-22 19:05:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,023 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 137 transitions. [2024-11-22 19:05:23,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 137 transitions. [2024-11-22 19:05:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:23,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 19:05:23,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1920623345, now seen corresponding path program 1 times [2024-11-22 19:05:23,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6563312] [2024-11-22 19:05:23,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6563312] [2024-11-22 19:05:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6563312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874946909] [2024-11-22 19:05:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,071 INFO L87 Difference]: Start difference. First operand 77 states and 137 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,093 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2024-11-22 19:05:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2024-11-22 19:05:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,095 INFO L225 Difference]: With dead ends: 145 [2024-11-22 19:05:23,096 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 19:05:23,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,097 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 19:05:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2024-11-22 19:05:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 182 transitions. [2024-11-22 19:05:23,113 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 182 transitions. Word has length 20 [2024-11-22 19:05:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,113 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 182 transitions. [2024-11-22 19:05:23,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 182 transitions. [2024-11-22 19:05:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:23,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 19:05:23,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 640759667, now seen corresponding path program 1 times [2024-11-22 19:05:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220126687] [2024-11-22 19:05:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220126687] [2024-11-22 19:05:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220126687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297067748] [2024-11-22 19:05:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,165 INFO L87 Difference]: Start difference. First operand 102 states and 182 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,181 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2024-11-22 19:05:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2024-11-22 19:05:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,183 INFO L225 Difference]: With dead ends: 147 [2024-11-22 19:05:23,183 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 19:05:23,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,184 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 19:05:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-22 19:05:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 256 transitions. [2024-11-22 19:05:23,191 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 256 transitions. Word has length 20 [2024-11-22 19:05:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,192 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 256 transitions. [2024-11-22 19:05:23,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 256 transitions. [2024-11-22 19:05:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:23,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 19:05:23,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -583610434, now seen corresponding path program 1 times [2024-11-22 19:05:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165001278] [2024-11-22 19:05:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165001278] [2024-11-22 19:05:23,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165001278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833296742] [2024-11-22 19:05:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,223 INFO L87 Difference]: Start difference. First operand 144 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,233 INFO L93 Difference]: Finished difference Result 149 states and 258 transitions. [2024-11-22 19:05:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2024-11-22 19:05:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,235 INFO L225 Difference]: With dead ends: 149 [2024-11-22 19:05:23,235 INFO L226 Difference]: Without dead ends: 149 [2024-11-22 19:05:23,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,236 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-22 19:05:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-22 19:05:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 256 transitions. [2024-11-22 19:05:23,246 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 256 transitions. Word has length 21 [2024-11-22 19:05:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,246 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 256 transitions. [2024-11-22 19:05:23,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 256 transitions. [2024-11-22 19:05:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:23,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 19:05:23,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1604678788, now seen corresponding path program 1 times [2024-11-22 19:05:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291955234] [2024-11-22 19:05:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291955234] [2024-11-22 19:05:23,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291955234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851448318] [2024-11-22 19:05:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,282 INFO L87 Difference]: Start difference. First operand 146 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,293 INFO L93 Difference]: Finished difference Result 281 states and 486 transitions. [2024-11-22 19:05:23,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2024-11-22 19:05:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,295 INFO L225 Difference]: With dead ends: 281 [2024-11-22 19:05:23,295 INFO L226 Difference]: Without dead ends: 281 [2024-11-22 19:05:23,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,296 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-22 19:05:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-11-22 19:05:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7472924187725631) internal successors, (484), 277 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 484 transitions. [2024-11-22 19:05:23,310 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 484 transitions. Word has length 21 [2024-11-22 19:05:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,310 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 484 transitions. [2024-11-22 19:05:23,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 484 transitions. [2024-11-22 19:05:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:23,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 19:05:23,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -324815110, now seen corresponding path program 1 times [2024-11-22 19:05:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44946435] [2024-11-22 19:05:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44946435] [2024-11-22 19:05:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44946435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613777136] [2024-11-22 19:05:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,352 INFO L87 Difference]: Start difference. First operand 278 states and 484 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,362 INFO L93 Difference]: Finished difference Result 353 states and 618 transitions. [2024-11-22 19:05:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2024-11-22 19:05:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,364 INFO L225 Difference]: With dead ends: 353 [2024-11-22 19:05:23,365 INFO L226 Difference]: Without dead ends: 353 [2024-11-22 19:05:23,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,365 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-22 19:05:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 278. [2024-11-22 19:05:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 480 transitions. [2024-11-22 19:05:23,381 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 480 transitions. Word has length 21 [2024-11-22 19:05:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,381 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 480 transitions. [2024-11-22 19:05:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 480 transitions. [2024-11-22 19:05:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:23,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 19:05:23,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1801183710, now seen corresponding path program 1 times [2024-11-22 19:05:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922702372] [2024-11-22 19:05:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922702372] [2024-11-22 19:05:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922702372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728796524] [2024-11-22 19:05:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,414 INFO L87 Difference]: Start difference. First operand 278 states and 480 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,423 INFO L93 Difference]: Finished difference Result 517 states and 898 transitions. [2024-11-22 19:05:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) Word has length 22 [2024-11-22 19:05:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,426 INFO L225 Difference]: With dead ends: 517 [2024-11-22 19:05:23,426 INFO L226 Difference]: Without dead ends: 517 [2024-11-22 19:05:23,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,427 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-22 19:05:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 386. [2024-11-22 19:05:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.7038961038961038) internal successors, (656), 385 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 656 transitions. [2024-11-22 19:05:23,436 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 656 transitions. Word has length 22 [2024-11-22 19:05:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,437 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 656 transitions. [2024-11-22 19:05:23,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 656 transitions. [2024-11-22 19:05:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:23,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 19:05:23,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 521320032, now seen corresponding path program 1 times [2024-11-22 19:05:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24656197] [2024-11-22 19:05:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24656197] [2024-11-22 19:05:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24656197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059456423] [2024-11-22 19:05:23,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,472 INFO L87 Difference]: Start difference. First operand 386 states and 656 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,485 INFO L93 Difference]: Finished difference Result 541 states and 910 transitions. [2024-11-22 19:05:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) Word has length 22 [2024-11-22 19:05:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,487 INFO L225 Difference]: With dead ends: 541 [2024-11-22 19:05:23,487 INFO L226 Difference]: Without dead ends: 541 [2024-11-22 19:05:23,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,492 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-22 19:05:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2024-11-22 19:05:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.690875232774674) internal successors, (908), 537 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 908 transitions. [2024-11-22 19:05:23,503 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 908 transitions. Word has length 22 [2024-11-22 19:05:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,504 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 908 transitions. [2024-11-22 19:05:23,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 908 transitions. [2024-11-22 19:05:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:23,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 19:05:23,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 8749319, now seen corresponding path program 1 times [2024-11-22 19:05:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800342251] [2024-11-22 19:05:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800342251] [2024-11-22 19:05:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800342251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967764108] [2024-11-22 19:05:23,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,535 INFO L87 Difference]: Start difference. First operand 538 states and 908 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,549 INFO L93 Difference]: Finished difference Result 553 states and 918 transitions. [2024-11-22 19:05:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-22 19:05:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,552 INFO L225 Difference]: With dead ends: 553 [2024-11-22 19:05:23,552 INFO L226 Difference]: Without dead ends: 553 [2024-11-22 19:05:23,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,553 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-22 19:05:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2024-11-22 19:05:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 916 transitions. [2024-11-22 19:05:23,564 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 916 transitions. Word has length 23 [2024-11-22 19:05:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,564 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 916 transitions. [2024-11-22 19:05:23,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 916 transitions. [2024-11-22 19:05:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:23,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 19:05:23,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1012319035, now seen corresponding path program 1 times [2024-11-22 19:05:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266770078] [2024-11-22 19:05:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266770078] [2024-11-22 19:05:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266770078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406290496] [2024-11-22 19:05:23,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,597 INFO L87 Difference]: Start difference. First operand 550 states and 916 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,630 INFO L93 Difference]: Finished difference Result 1001 states and 1678 transitions. [2024-11-22 19:05:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-22 19:05:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,634 INFO L225 Difference]: With dead ends: 1001 [2024-11-22 19:05:23,634 INFO L226 Difference]: Without dead ends: 1001 [2024-11-22 19:05:23,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,635 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-22 19:05:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 774. [2024-11-22 19:05:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1260 transitions. [2024-11-22 19:05:23,647 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1260 transitions. Word has length 23 [2024-11-22 19:05:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,647 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1260 transitions. [2024-11-22 19:05:23,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1260 transitions. [2024-11-22 19:05:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:23,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 19:05:23,649 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2002784583, now seen corresponding path program 1 times [2024-11-22 19:05:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998552509] [2024-11-22 19:05:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998552509] [2024-11-22 19:05:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998552509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414516974] [2024-11-22 19:05:23,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,695 INFO L87 Difference]: Start difference. First operand 774 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,707 INFO L93 Difference]: Finished difference Result 1065 states and 1718 transitions. [2024-11-22 19:05:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-22 19:05:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,710 INFO L225 Difference]: With dead ends: 1065 [2024-11-22 19:05:23,711 INFO L226 Difference]: Without dead ends: 1065 [2024-11-22 19:05:23,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,711 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-22 19:05:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1062. [2024-11-22 19:05:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1716 transitions. [2024-11-22 19:05:23,726 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1716 transitions. Word has length 23 [2024-11-22 19:05:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,726 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1716 transitions. [2024-11-22 19:05:23,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1716 transitions. [2024-11-22 19:05:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:23,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 19:05:23,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1310479285, now seen corresponding path program 1 times [2024-11-22 19:05:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049691746] [2024-11-22 19:05:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049691746] [2024-11-22 19:05:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049691746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684094795] [2024-11-22 19:05:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,747 INFO L87 Difference]: Start difference. First operand 1062 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,758 INFO L93 Difference]: Finished difference Result 1081 states and 1718 transitions. [2024-11-22 19:05:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 24 [2024-11-22 19:05:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,760 INFO L225 Difference]: With dead ends: 1081 [2024-11-22 19:05:23,760 INFO L226 Difference]: Without dead ends: 1081 [2024-11-22 19:05:23,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,761 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-22 19:05:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1078. [2024-11-22 19:05:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1716 transitions. [2024-11-22 19:05:23,774 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1716 transitions. Word has length 24 [2024-11-22 19:05:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1716 transitions. [2024-11-22 19:05:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1716 transitions. [2024-11-22 19:05:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:23,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 19:05:23,777 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1963419657, now seen corresponding path program 1 times [2024-11-22 19:05:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290861593] [2024-11-22 19:05:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290861593] [2024-11-22 19:05:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290861593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385296006] [2024-11-22 19:05:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,798 INFO L87 Difference]: Start difference. First operand 1078 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,810 INFO L93 Difference]: Finished difference Result 1929 states and 3094 transitions. [2024-11-22 19:05:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 24 [2024-11-22 19:05:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,814 INFO L225 Difference]: With dead ends: 1929 [2024-11-22 19:05:23,814 INFO L226 Difference]: Without dead ends: 1929 [2024-11-22 19:05:23,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,814 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-22 19:05:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1542. [2024-11-22 19:05:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2388 transitions. [2024-11-22 19:05:23,835 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2388 transitions. Word has length 24 [2024-11-22 19:05:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,835 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2388 transitions. [2024-11-22 19:05:23,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2388 transitions. [2024-11-22 19:05:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:23,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 19:05:23,837 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash 683555979, now seen corresponding path program 1 times [2024-11-22 19:05:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814385209] [2024-11-22 19:05:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814385209] [2024-11-22 19:05:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814385209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702006718] [2024-11-22 19:05:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,859 INFO L87 Difference]: Start difference. First operand 1542 states and 2388 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,879 INFO L93 Difference]: Finished difference Result 2089 states and 3206 transitions. [2024-11-22 19:05:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 24 [2024-11-22 19:05:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,888 INFO L225 Difference]: With dead ends: 2089 [2024-11-22 19:05:23,888 INFO L226 Difference]: Without dead ends: 2089 [2024-11-22 19:05:23,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,889 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-22 19:05:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2086. [2024-11-22 19:05:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3204 transitions. [2024-11-22 19:05:23,913 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3204 transitions. Word has length 24 [2024-11-22 19:05:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,913 INFO L471 AbstractCegarLoop]: Abstraction has 2086 states and 3204 transitions. [2024-11-22 19:05:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3204 transitions. [2024-11-22 19:05:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:23,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 19:05:23,915 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 743117522, now seen corresponding path program 1 times [2024-11-22 19:05:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445054688] [2024-11-22 19:05:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445054688] [2024-11-22 19:05:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445054688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435704278] [2024-11-22 19:05:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,938 INFO L87 Difference]: Start difference. First operand 2086 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:23,950 INFO L93 Difference]: Finished difference Result 2121 states and 3206 transitions. [2024-11-22 19:05:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2024-11-22 19:05:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:23,955 INFO L225 Difference]: With dead ends: 2121 [2024-11-22 19:05:23,955 INFO L226 Difference]: Without dead ends: 2121 [2024-11-22 19:05:23,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:23,956 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:23,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-11-22 19:05:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2118. [2024-11-22 19:05:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3204 transitions. [2024-11-22 19:05:23,979 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3204 transitions. Word has length 25 [2024-11-22 19:05:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 2118 states and 3204 transitions. [2024-11-22 19:05:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3204 transitions. [2024-11-22 19:05:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:23,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:23,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:23,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 19:05:23,993 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:23,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash -277950832, now seen corresponding path program 1 times [2024-11-22 19:05:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126112073] [2024-11-22 19:05:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126112073] [2024-11-22 19:05:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126112073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095960628] [2024-11-22 19:05:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,017 INFO L87 Difference]: Start difference. First operand 2118 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,035 INFO L93 Difference]: Finished difference Result 3721 states and 5670 transitions. [2024-11-22 19:05:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2024-11-22 19:05:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,043 INFO L225 Difference]: With dead ends: 3721 [2024-11-22 19:05:24,043 INFO L226 Difference]: Without dead ends: 3721 [2024-11-22 19:05:24,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,044 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-22 19:05:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3078. [2024-11-22 19:05:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4516 transitions. [2024-11-22 19:05:24,086 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4516 transitions. Word has length 25 [2024-11-22 19:05:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,086 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4516 transitions. [2024-11-22 19:05:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4516 transitions. [2024-11-22 19:05:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:24,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 19:05:24,090 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1557814510, now seen corresponding path program 1 times [2024-11-22 19:05:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137821661] [2024-11-22 19:05:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137821661] [2024-11-22 19:05:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137821661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902045690] [2024-11-22 19:05:24,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,112 INFO L87 Difference]: Start difference. First operand 3078 states and 4516 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,130 INFO L93 Difference]: Finished difference Result 4105 states and 5958 transitions. [2024-11-22 19:05:24,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2024-11-22 19:05:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,138 INFO L225 Difference]: With dead ends: 4105 [2024-11-22 19:05:24,138 INFO L226 Difference]: Without dead ends: 4105 [2024-11-22 19:05:24,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,139 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2024-11-22 19:05:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4102. [2024-11-22 19:05:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5956 transitions. [2024-11-22 19:05:24,187 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5956 transitions. Word has length 25 [2024-11-22 19:05:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,187 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5956 transitions. [2024-11-22 19:05:24,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5956 transitions. [2024-11-22 19:05:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:24,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 19:05:24,191 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash -19880330, now seen corresponding path program 1 times [2024-11-22 19:05:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077559856] [2024-11-22 19:05:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077559856] [2024-11-22 19:05:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077559856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009369906] [2024-11-22 19:05:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,211 INFO L87 Difference]: Start difference. First operand 4102 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,231 INFO L93 Difference]: Finished difference Result 4169 states and 5958 transitions. [2024-11-22 19:05:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26 [2024-11-22 19:05:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,243 INFO L225 Difference]: With dead ends: 4169 [2024-11-22 19:05:24,243 INFO L226 Difference]: Without dead ends: 4169 [2024-11-22 19:05:24,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,244 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2024-11-22 19:05:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4166. [2024-11-22 19:05:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4166 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 5956 transitions. [2024-11-22 19:05:24,310 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 5956 transitions. Word has length 26 [2024-11-22 19:05:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 4166 states and 5956 transitions. [2024-11-22 19:05:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 5956 transitions. [2024-11-22 19:05:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:24,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 19:05:24,313 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1040948684, now seen corresponding path program 1 times [2024-11-22 19:05:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922709928] [2024-11-22 19:05:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922709928] [2024-11-22 19:05:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922709928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834809550] [2024-11-22 19:05:24,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,339 INFO L87 Difference]: Start difference. First operand 4166 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,365 INFO L93 Difference]: Finished difference Result 7177 states and 10310 transitions. [2024-11-22 19:05:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26 [2024-11-22 19:05:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,376 INFO L225 Difference]: With dead ends: 7177 [2024-11-22 19:05:24,379 INFO L226 Difference]: Without dead ends: 7177 [2024-11-22 19:05:24,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,379 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2024-11-22 19:05:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 6150. [2024-11-22 19:05:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6150 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 8516 transitions. [2024-11-22 19:05:24,445 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 8516 transitions. Word has length 26 [2024-11-22 19:05:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,445 INFO L471 AbstractCegarLoop]: Abstraction has 6150 states and 8516 transitions. [2024-11-22 19:05:24,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 8516 transitions. [2024-11-22 19:05:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:24,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 19:05:24,450 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1974154934, now seen corresponding path program 1 times [2024-11-22 19:05:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938666128] [2024-11-22 19:05:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938666128] [2024-11-22 19:05:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938666128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301432658] [2024-11-22 19:05:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,467 INFO L87 Difference]: Start difference. First operand 6150 states and 8516 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,499 INFO L93 Difference]: Finished difference Result 8073 states and 11014 transitions. [2024-11-22 19:05:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26 [2024-11-22 19:05:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,511 INFO L225 Difference]: With dead ends: 8073 [2024-11-22 19:05:24,511 INFO L226 Difference]: Without dead ends: 8073 [2024-11-22 19:05:24,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,513 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8073 states. [2024-11-22 19:05:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8073 to 8070. [2024-11-22 19:05:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8070 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8070 states to 8070 states and 11012 transitions. [2024-11-22 19:05:24,686 INFO L78 Accepts]: Start accepts. Automaton has 8070 states and 11012 transitions. Word has length 26 [2024-11-22 19:05:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,686 INFO L471 AbstractCegarLoop]: Abstraction has 8070 states and 11012 transitions. [2024-11-22 19:05:24,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8070 states and 11012 transitions. [2024-11-22 19:05:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:24,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 19:05:24,703 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2097000605, now seen corresponding path program 1 times [2024-11-22 19:05:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952636404] [2024-11-22 19:05:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952636404] [2024-11-22 19:05:24,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952636404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3447817] [2024-11-22 19:05:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,724 INFO L87 Difference]: Start difference. First operand 8070 states and 11012 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,752 INFO L93 Difference]: Finished difference Result 8201 states and 11014 transitions. [2024-11-22 19:05:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2024-11-22 19:05:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,764 INFO L225 Difference]: With dead ends: 8201 [2024-11-22 19:05:24,764 INFO L226 Difference]: Without dead ends: 8201 [2024-11-22 19:05:24,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,765 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2024-11-22 19:05:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 8198. [2024-11-22 19:05:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8198 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8198 states to 8198 states and 11012 transitions. [2024-11-22 19:05:24,859 INFO L78 Accepts]: Start accepts. Automaton has 8198 states and 11012 transitions. Word has length 27 [2024-11-22 19:05:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:24,859 INFO L471 AbstractCegarLoop]: Abstraction has 8198 states and 11012 transitions. [2024-11-22 19:05:24,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8198 states and 11012 transitions. [2024-11-22 19:05:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:24,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:24,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:24,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 19:05:24,885 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:24,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1075932251, now seen corresponding path program 1 times [2024-11-22 19:05:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196431449] [2024-11-22 19:05:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196431449] [2024-11-22 19:05:24,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196431449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:24,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:24,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:24,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165902455] [2024-11-22 19:05:24,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:24,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,901 INFO L87 Difference]: Start difference. First operand 8198 states and 11012 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:24,957 INFO L93 Difference]: Finished difference Result 13833 states and 18566 transitions. [2024-11-22 19:05:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:24,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2024-11-22 19:05:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:24,979 INFO L225 Difference]: With dead ends: 13833 [2024-11-22 19:05:24,979 INFO L226 Difference]: Without dead ends: 13833 [2024-11-22 19:05:24,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:24,980 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:24,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2024-11-22 19:05:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 12294. [2024-11-22 19:05:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12294 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 16004 transitions. [2024-11-22 19:05:25,139 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 16004 transitions. Word has length 27 [2024-11-22 19:05:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,139 INFO L471 AbstractCegarLoop]: Abstraction has 12294 states and 16004 transitions. [2024-11-22 19:05:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 16004 transitions. [2024-11-22 19:05:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:25,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 19:05:25,150 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -203931427, now seen corresponding path program 1 times [2024-11-22 19:05:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251150113] [2024-11-22 19:05:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251150113] [2024-11-22 19:05:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251150113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849736035] [2024-11-22 19:05:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,167 INFO L87 Difference]: Start difference. First operand 12294 states and 16004 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,252 INFO L93 Difference]: Finished difference Result 15881 states and 20230 transitions. [2024-11-22 19:05:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2024-11-22 19:05:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,274 INFO L225 Difference]: With dead ends: 15881 [2024-11-22 19:05:25,274 INFO L226 Difference]: Without dead ends: 15881 [2024-11-22 19:05:25,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,274 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:25,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 167 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2024-11-22 19:05:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15878. [2024-11-22 19:05:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15878 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 20228 transitions. [2024-11-22 19:05:25,527 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 20228 transitions. Word has length 27 [2024-11-22 19:05:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,527 INFO L471 AbstractCegarLoop]: Abstraction has 15878 states and 20228 transitions. [2024-11-22 19:05:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 20228 transitions. [2024-11-22 19:05:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:05:25,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 19:05:25,548 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash -999156575, now seen corresponding path program 1 times [2024-11-22 19:05:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018220473] [2024-11-22 19:05:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018220473] [2024-11-22 19:05:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018220473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983554576] [2024-11-22 19:05:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,567 INFO L87 Difference]: Start difference. First operand 15878 states and 20228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,609 INFO L93 Difference]: Finished difference Result 16137 states and 20230 transitions. [2024-11-22 19:05:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2024-11-22 19:05:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:25,631 INFO L225 Difference]: With dead ends: 16137 [2024-11-22 19:05:25,631 INFO L226 Difference]: Without dead ends: 16137 [2024-11-22 19:05:25,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,632 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:25,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2024-11-22 19:05:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16134. [2024-11-22 19:05:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16134 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 20228 transitions. [2024-11-22 19:05:25,872 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 20228 transitions. Word has length 28 [2024-11-22 19:05:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:25,872 INFO L471 AbstractCegarLoop]: Abstraction has 16134 states and 20228 transitions. [2024-11-22 19:05:25,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 20228 transitions. [2024-11-22 19:05:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:05:25,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:25,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:25,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 19:05:25,887 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2020224929, now seen corresponding path program 1 times [2024-11-22 19:05:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583125430] [2024-11-22 19:05:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:25,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:25,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583125430] [2024-11-22 19:05:25,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583125430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:25,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031735571] [2024-11-22 19:05:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:25,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:25,907 INFO L87 Difference]: Start difference. First operand 16134 states and 20228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:25,983 INFO L93 Difference]: Finished difference Result 26633 states and 33030 transitions. [2024-11-22 19:05:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2024-11-22 19:05:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:26,024 INFO L225 Difference]: With dead ends: 26633 [2024-11-22 19:05:26,025 INFO L226 Difference]: Without dead ends: 26633 [2024-11-22 19:05:26,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,025 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:26,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26633 states. [2024-11-22 19:05:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26633 to 24582. [2024-11-22 19:05:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24582 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24582 states to 24582 states and 29956 transitions. [2024-11-22 19:05:26,501 INFO L78 Accepts]: Start accepts. Automaton has 24582 states and 29956 transitions. Word has length 28 [2024-11-22 19:05:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 24582 states and 29956 transitions. [2024-11-22 19:05:26,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24582 states and 29956 transitions. [2024-11-22 19:05:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:05:26,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:26,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:26,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-22 19:05:26,548 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 994878689, now seen corresponding path program 1 times [2024-11-22 19:05:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883488428] [2024-11-22 19:05:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883488428] [2024-11-22 19:05:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883488428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961811050] [2024-11-22 19:05:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:26,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:26,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:26,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,571 INFO L87 Difference]: Start difference. First operand 24582 states and 29956 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:26,643 INFO L93 Difference]: Finished difference Result 31241 states and 36870 transitions. [2024-11-22 19:05:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2024-11-22 19:05:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:26,683 INFO L225 Difference]: With dead ends: 31241 [2024-11-22 19:05:26,683 INFO L226 Difference]: Without dead ends: 31241 [2024-11-22 19:05:26,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:26,684 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:26,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31241 states. [2024-11-22 19:05:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31241 to 31238. [2024-11-22 19:05:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31238 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31238 states to 31238 states and 36868 transitions. [2024-11-22 19:05:27,157 INFO L78 Accepts]: Start accepts. Automaton has 31238 states and 36868 transitions. Word has length 28 [2024-11-22 19:05:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:27,157 INFO L471 AbstractCegarLoop]: Abstraction has 31238 states and 36868 transitions. [2024-11-22 19:05:27,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31238 states and 36868 transitions. [2024-11-22 19:05:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 19:05:27,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:27,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:27,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 19:05:27,189 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:27,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1804229224, now seen corresponding path program 1 times [2024-11-22 19:05:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182253768] [2024-11-22 19:05:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:27,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182253768] [2024-11-22 19:05:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182253768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:27,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:27,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37794422] [2024-11-22 19:05:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:27,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:27,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:27,211 INFO L87 Difference]: Start difference. First operand 31238 states and 36868 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:27,288 INFO L93 Difference]: Finished difference Result 31753 states and 36870 transitions. [2024-11-22 19:05:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:27,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) Word has length 29 [2024-11-22 19:05:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:27,506 INFO L225 Difference]: With dead ends: 31753 [2024-11-22 19:05:27,506 INFO L226 Difference]: Without dead ends: 31753 [2024-11-22 19:05:27,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:27,507 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:27,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31753 states. [2024-11-22 19:05:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31753 to 31750. [2024-11-22 19:05:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 36868 transitions. [2024-11-22 19:05:27,881 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 36868 transitions. Word has length 29 [2024-11-22 19:05:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:27,881 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 36868 transitions. [2024-11-22 19:05:27,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 36868 transitions. [2024-11-22 19:05:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 19:05:27,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:27,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:27,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-22 19:05:27,899 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:27,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 783160870, now seen corresponding path program 1 times [2024-11-22 19:05:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681723979] [2024-11-22 19:05:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:27,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:27,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681723979] [2024-11-22 19:05:27,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681723979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:27,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908064890] [2024-11-22 19:05:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:27,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:27,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:27,917 INFO L87 Difference]: Start difference. First operand 31750 states and 36868 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:28,152 INFO L93 Difference]: Finished difference Result 61446 states and 67588 transitions. [2024-11-22 19:05:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) Word has length 29 [2024-11-22 19:05:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:28,196 INFO L225 Difference]: With dead ends: 61446 [2024-11-22 19:05:28,196 INFO L226 Difference]: Without dead ends: 31750 [2024-11-22 19:05:28,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,198 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:28,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2024-11-22 19:05:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31750. [2024-11-22 19:05:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.0967274559828657) internal successors, (34820), 31749 states have internal predecessors, (34820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 34820 transitions. [2024-11-22 19:05:28,625 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 34820 transitions. Word has length 29 [2024-11-22 19:05:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:28,626 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 34820 transitions. [2024-11-22 19:05:28,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 34820 transitions. [2024-11-22 19:05:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 19:05:28,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:28,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:28,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-22 19:05:28,649 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:28,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2063024548, now seen corresponding path program 1 times [2024-11-22 19:05:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266049830] [2024-11-22 19:05:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266049830] [2024-11-22 19:05:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266049830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:28,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:28,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162815238] [2024-11-22 19:05:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:28,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:28,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:28,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,669 INFO L87 Difference]: Start difference. First operand 31750 states and 34820 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:28,748 INFO L93 Difference]: Finished difference Result 31747 states and 33794 transitions. [2024-11-22 19:05:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) Word has length 29 [2024-11-22 19:05:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:28,749 INFO L225 Difference]: With dead ends: 31747 [2024-11-22 19:05:28,749 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 19:05:28,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:28,750 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:28,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 19:05:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 19:05:28,751 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) [2024-11-22 19:05:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 19:05:28,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-11-22 19:05:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:28,751 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 19:05:28,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 19:05:28,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 19:05:28,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-22 19:05:28,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-22 19:05:28,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-22 19:05:28,758 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:28,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 19:05:28,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:05:28 BoogieIcfgContainer [2024-11-22 19:05:28,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 19:05:28,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 19:05:28,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 19:05:28,764 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 19:05:28,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:22" (3/4) ... [2024-11-22 19:05:28,768 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 19:05:28,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-22 19:05:28,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-22 19:05:28,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 19:05:28,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 19:05:28,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 19:05:28,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 19:05:28,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 19:05:28,875 INFO L158 Benchmark]: Toolchain (without parser) took 7357.65ms. Allocated memory was 163.6MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 90.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 462.3MB. Max. memory is 16.1GB. [2024-11-22 19:05:28,875 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 19:05:28,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.83ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 134.8MB in the end (delta: -44.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-22 19:05:28,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 163.6MB. Free memory was 134.8MB in the beginning and 133.9MB in the end (delta: 965.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 19:05:28,876 INFO L158 Benchmark]: Boogie Preprocessor took 30.64ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 131.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 19:05:28,878 INFO L158 Benchmark]: RCFGBuilder took 359.86ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 115.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 19:05:28,878 INFO L158 Benchmark]: TraceAbstraction took 6535.41ms. Allocated memory was 163.6MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 114.8MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 478.7MB. Max. memory is 16.1GB. [2024-11-22 19:05:28,879 INFO L158 Benchmark]: Witness Printer took 110.44ms. Allocated memory is still 3.9GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 19:05:28,880 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.14ms. Allocated memory is still 163.6MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.83ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 134.8MB in the end (delta: -44.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 163.6MB. Free memory was 134.8MB in the beginning and 133.9MB in the end (delta: 965.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.64ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 131.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.86ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 115.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6535.41ms. Allocated memory was 163.6MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 114.8MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 478.7MB. Max. memory is 16.1GB. * Witness Printer took 110.44ms. Allocated memory is still 3.9GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 4807 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1861 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2946 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31750occurred in iteration=31, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 6205 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 19:05:28,894 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE