./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:32:59,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:32:59,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:32:59,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:32:59,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:32:59,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:32:59,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:32:59,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:32:59,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:32:59,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:32:59,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:32:59,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:32:59,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:32:59,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:32:59,820 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:32:59,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:32:59,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:32:59,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:32:59,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:32:59,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:32:59,822 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:32:59,823 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:32:59,823 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:32:59,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:32:59,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:32:59,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:32:59,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:32:59,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:32:59,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:32:59,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:32:59,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:32:59,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:32:59,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:32:59,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:32:59,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:32:59,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:32:59,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:32:59,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:32:59,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:32:59,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:32:59,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:32:59,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:32:59,828 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-10 15:33:00,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:33:00,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:33:00,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:33:00,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:33:00,078 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:33:00,080 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-10 15:33:01,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:33:01,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:33:01,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-11-10 15:33:01,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc93e4a7/48075aef55524727971f9b4a8130782e/FLAG1ad43ae8c [2024-11-10 15:33:01,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc93e4a7/48075aef55524727971f9b4a8130782e [2024-11-10 15:33:01,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:33:01,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:33:01,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:33:01,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:33:01,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:33:01,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d61a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01, skipping insertion in model container [2024-11-10 15:33:01,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:33:01,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:33:01,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:33:01,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:33:01,785 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:33:01,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01 WrapperNode [2024-11-10 15:33:01,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:33:01,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:33:01,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:33:01,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:33:01,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,815 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 160 [2024-11-10 15:33:01,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:33:01,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:33:01,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:33:01,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:33:01,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,834 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-10 15:33:01,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:33:01,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:33:01,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:33:01,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:33:01,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (1/1) ... [2024-11-10 15:33:01,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:33:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:33:01,874 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-10 15:33:01,876 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-10 15:33:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:33:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:33:01,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:33:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:33:01,975 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:33:01,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:33:02,203 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 15:33:02,203 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:33:02,222 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:33:02,222 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:33:02,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:02 BoogieIcfgContainer [2024-11-10 15:33:02,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:33:02,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:33:02,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:33:02,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:33:02,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:33:01" (1/3) ... [2024-11-10 15:33:02,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac7ded8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:02, skipping insertion in model container [2024-11-10 15:33:02,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:01" (2/3) ... [2024-11-10 15:33:02,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac7ded8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:02, skipping insertion in model container [2024-11-10 15:33:02,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:02" (3/3) ... [2024-11-10 15:33:02,229 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-11-10 15:33:02,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:33:02,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 15:33:02,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:33:02,284 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;@814ecdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:33:02,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 15:33:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 46 states have (on average 1.826086956521739) internal successors, (84), 48 states have internal predecessors, (84), 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-10 15:33:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:33:02,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:02,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:33:02,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 200623473, now seen corresponding path program 1 times [2024-11-10 15:33:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474530980] [2024-11-10 15:33:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:02,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:02,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474530980] [2024-11-10 15:33:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474530980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:33:02,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293881895] [2024-11-10 15:33:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:02,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:33:02,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:33:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:33:02,470 INFO L87 Difference]: Start difference. First operand has 49 states, 46 states have (on average 1.826086956521739) internal successors, (84), 48 states have internal predecessors, (84), 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 3.0) internal successors, (6), 2 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-10 15:33:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:02,486 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2024-11-10 15:33:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:33:02,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10 15:33:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:02,495 INFO L225 Difference]: With dead ends: 48 [2024-11-10 15:33:02,495 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 15:33:02,496 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-10 15:33:02,500 INFO L432 NwaCegarLoop]: 80 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, 80 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-10 15:33:02,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 15:33:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-10 15:33:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 44 states have internal predecessors, (77), 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-10 15:33:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2024-11-10 15:33:02,597 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 6 [2024-11-10 15:33:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:02,600 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2024-11-10 15:33:02,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10 15:33:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2024-11-10 15:33:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:33:02,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:02,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:33:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:33:02,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -400004648, now seen corresponding path program 1 times [2024-11-10 15:33:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249267050] [2024-11-10 15:33:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:02,683 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-10 15:33:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:02,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249267050] [2024-11-10 15:33:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249267050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:02,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:02,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:33:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324554391] [2024-11-10 15:33:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:02,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:02,690 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10 15:33:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:02,698 INFO L93 Difference]: Finished difference Result 44 states and 76 transitions. [2024-11-10 15:33:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-10 15:33:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:02,701 INFO L225 Difference]: With dead ends: 44 [2024-11-10 15:33:02,701 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 15:33:02,701 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-10 15:33:02,702 INFO L432 NwaCegarLoop]: 76 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, 76 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-10 15:33:02,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 15:33:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 15:33:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 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-10 15:33:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2024-11-10 15:33:02,710 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 8 [2024-11-10 15:33:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:02,712 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2024-11-10 15:33:02,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10 15:33:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2024-11-10 15:33:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:33:02,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:02,714 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-10 15:33:02,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:33:02,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:02,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 400063563, now seen corresponding path program 1 times [2024-11-10 15:33:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790293070] [2024-11-10 15:33:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:02,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-10 15:33:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790293070] [2024-11-10 15:33:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790293070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143420587] [2024-11-10 15:33:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:02,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:02,798 INFO L87 Difference]: Start difference. First operand 41 states and 73 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-10 15:33:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:02,828 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2024-11-10 15:33:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:02,828 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-10 15:33:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:02,830 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:33:02,831 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:33:02,831 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-10 15:33:02,832 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 145 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-10 15:33:02,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:33:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2024-11-10 15:33:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 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-10 15:33:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 96 transitions. [2024-11-10 15:33:02,843 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 96 transitions. Word has length 20 [2024-11-10 15:33:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:02,843 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 96 transitions. [2024-11-10 15:33:02,844 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-10 15:33:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 96 transitions. [2024-11-10 15:33:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:33:02,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:02,845 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-10 15:33:02,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:33:02,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:02,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1907615372, now seen corresponding path program 1 times [2024-11-10 15:33:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313710963] [2024-11-10 15:33:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:02,921 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-10 15:33:02,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:02,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313710963] [2024-11-10 15:33:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313710963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650434348] [2024-11-10 15:33:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:02,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:02,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:02,923 INFO L87 Difference]: Start difference. First operand 53 states and 96 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-10 15:33:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:02,949 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2024-11-10 15:33:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:02,950 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-10 15:33:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:02,950 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:33:02,950 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:33:02,950 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-10 15:33:02,951 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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-10 15:33:02,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:33:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-10 15:33:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 75 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-10 15:33:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2024-11-10 15:33:02,963 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 20 [2024-11-10 15:33:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:02,963 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2024-11-10 15:33:02,963 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-10 15:33:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2024-11-10 15:33:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:33:02,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:02,964 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-10 15:33:02,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:33:02,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:02,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -482061692, now seen corresponding path program 1 times [2024-11-10 15:33:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:02,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815736966] [2024-11-10 15:33:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:02,995 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-10 15:33:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:02,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815736966] [2024-11-10 15:33:02,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815736966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:02,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922735635] [2024-11-10 15:33:02,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:02,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:02,997 INFO L87 Difference]: Start difference. First operand 76 states and 137 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-10 15:33:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,008 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2024-11-10 15:33:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,009 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-10 15:33:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,009 INFO L225 Difference]: With dead ends: 83 [2024-11-10 15:33:03,009 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 15:33:03,009 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-10 15:33:03,010 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 57 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 182 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-10 15:33:03,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 15:33:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-10 15:33:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 79 states have internal predecessors, (140), 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-10 15:33:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2024-11-10 15:33:03,019 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 21 [2024-11-10 15:33:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,019 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2024-11-10 15:33:03,019 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-10 15:33:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2024-11-10 15:33:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:33:03,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,020 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-10 15:33:03,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:33:03,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -992595869, now seen corresponding path program 1 times [2024-11-10 15:33:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065006819] [2024-11-10 15:33:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,047 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-10 15:33:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065006819] [2024-11-10 15:33:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065006819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800930547] [2024-11-10 15:33:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,049 INFO L87 Difference]: Start difference. First operand 80 states and 140 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-10 15:33:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,059 INFO L93 Difference]: Finished difference Result 150 states and 265 transitions. [2024-11-10 15:33:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,060 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-10 15:33:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,062 INFO L225 Difference]: With dead ends: 150 [2024-11-10 15:33:03,063 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 15:33:03,063 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-10 15:33:03,064 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 52 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 143 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-10 15:33:03,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 15:33:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 105. [2024-11-10 15:33:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.7788461538461537) internal successors, (185), 104 states have internal predecessors, (185), 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-10 15:33:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 185 transitions. [2024-11-10 15:33:03,069 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 185 transitions. Word has length 21 [2024-11-10 15:33:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,069 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 185 transitions. [2024-11-10 15:33:03,069 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-10 15:33:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 185 transitions. [2024-11-10 15:33:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:33:03,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,070 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-10 15:33:03,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:33:03,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 514955940, now seen corresponding path program 1 times [2024-11-10 15:33:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283824821] [2024-11-10 15:33:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,094 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-10 15:33:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283824821] [2024-11-10 15:33:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283824821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323019954] [2024-11-10 15:33:03,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,096 INFO L87 Difference]: Start difference. First operand 105 states and 185 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-10 15:33:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,106 INFO L93 Difference]: Finished difference Result 152 states and 263 transitions. [2024-11-10 15:33:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,107 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-10 15:33:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,108 INFO L225 Difference]: With dead ends: 152 [2024-11-10 15:33:03,108 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 15:33:03,108 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-10 15:33:03,108 INFO L432 NwaCegarLoop]: 97 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, 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-10 15:33:03,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 15:33:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2024-11-10 15:33:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 148 states have internal predecessors, (261), 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-10 15:33:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 261 transitions. [2024-11-10 15:33:03,114 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 261 transitions. Word has length 21 [2024-11-10 15:33:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,114 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 261 transitions. [2024-11-10 15:33:03,115 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-10 15:33:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 261 transitions. [2024-11-10 15:33:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:33:03,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,115 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-10 15:33:03,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:33:03,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash -704837851, now seen corresponding path program 1 times [2024-11-10 15:33:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953297861] [2024-11-10 15:33:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,138 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-10 15:33:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953297861] [2024-11-10 15:33:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953297861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333816810] [2024-11-10 15:33:03,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,140 INFO L87 Difference]: Start difference. First operand 149 states and 261 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-10 15:33:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,149 INFO L93 Difference]: Finished difference Result 154 states and 263 transitions. [2024-11-10 15:33:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,149 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-10 15:33:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,150 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:33:03,150 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:33:03,150 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-10 15:33:03,151 INFO L432 NwaCegarLoop]: 113 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, 178 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-10 15:33:03,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:33:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-11-10 15:33:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.74) internal successors, (261), 150 states have internal predecessors, (261), 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-10 15:33:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 261 transitions. [2024-11-10 15:33:03,156 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 261 transitions. Word has length 22 [2024-11-10 15:33:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,156 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 261 transitions. [2024-11-10 15:33:03,156 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-10 15:33:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 261 transitions. [2024-11-10 15:33:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:33:03,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,157 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-10 15:33:03,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:33:03,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1215372028, now seen corresponding path program 1 times [2024-11-10 15:33:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164107650] [2024-11-10 15:33:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,180 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-10 15:33:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164107650] [2024-11-10 15:33:03,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164107650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168639617] [2024-11-10 15:33:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,182 INFO L87 Difference]: Start difference. First operand 151 states and 261 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-10 15:33:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,190 INFO L93 Difference]: Finished difference Result 282 states and 491 transitions. [2024-11-10 15:33:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,191 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-10 15:33:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,192 INFO L225 Difference]: With dead ends: 282 [2024-11-10 15:33:03,194 INFO L226 Difference]: Without dead ends: 282 [2024-11-10 15:33:03,194 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-10 15:33:03,195 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 141 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-10 15:33:03,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-10 15:33:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 203. [2024-11-10 15:33:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.7277227722772277) internal successors, (349), 202 states have internal predecessors, (349), 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-10 15:33:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 349 transitions. [2024-11-10 15:33:03,204 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 349 transitions. Word has length 22 [2024-11-10 15:33:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,204 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 349 transitions. [2024-11-10 15:33:03,204 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-10 15:33:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 349 transitions. [2024-11-10 15:33:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:33:03,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,205 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-10 15:33:03,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:33:03,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 292179781, now seen corresponding path program 1 times [2024-11-10 15:33:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373615113] [2024-11-10 15:33:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,235 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-10 15:33:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373615113] [2024-11-10 15:33:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373615113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469165730] [2024-11-10 15:33:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,237 INFO L87 Difference]: Start difference. First operand 203 states and 349 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-10 15:33:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,250 INFO L93 Difference]: Finished difference Result 290 states and 491 transitions. [2024-11-10 15:33:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,250 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-10 15:33:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,251 INFO L225 Difference]: With dead ends: 290 [2024-11-10 15:33:03,251 INFO L226 Difference]: Without dead ends: 290 [2024-11-10 15:33:03,251 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-10 15:33:03,252 INFO L432 NwaCegarLoop]: 99 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, 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-10 15:33:03,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-10 15:33:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-10 15:33:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.7097902097902098) internal successors, (489), 286 states have internal predecessors, (489), 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-10 15:33:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 489 transitions. [2024-11-10 15:33:03,262 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 489 transitions. Word has length 22 [2024-11-10 15:33:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 489 transitions. [2024-11-10 15:33:03,263 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-10 15:33:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 489 transitions. [2024-11-10 15:33:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:33:03,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,264 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-10 15:33:03,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:33:03,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 979029085, now seen corresponding path program 1 times [2024-11-10 15:33:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238684417] [2024-11-10 15:33:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,290 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-10 15:33:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238684417] [2024-11-10 15:33:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238684417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896589401] [2024-11-10 15:33:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,291 INFO L87 Difference]: Start difference. First operand 287 states and 489 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-10 15:33:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,301 INFO L93 Difference]: Finished difference Result 294 states and 491 transitions. [2024-11-10 15:33:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,301 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-10 15:33:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,302 INFO L225 Difference]: With dead ends: 294 [2024-11-10 15:33:03,302 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 15:33:03,302 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-10 15:33:03,303 INFO L432 NwaCegarLoop]: 110 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, 174 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-10 15:33:03,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 15:33:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-11-10 15:33:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.686206896551724) internal successors, (489), 290 states have internal predecessors, (489), 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-10 15:33:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 489 transitions. [2024-11-10 15:33:03,308 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 489 transitions. Word has length 23 [2024-11-10 15:33:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,308 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 489 transitions. [2024-11-10 15:33:03,308 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-10 15:33:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 489 transitions. [2024-11-10 15:33:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:33:03,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,309 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-10 15:33:03,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:33:03,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash 468494908, now seen corresponding path program 1 times [2024-11-10 15:33:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915589374] [2024-11-10 15:33:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,344 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-10 15:33:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915589374] [2024-11-10 15:33:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915589374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273963789] [2024-11-10 15:33:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,346 INFO L87 Difference]: Start difference. First operand 291 states and 489 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-10 15:33:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,355 INFO L93 Difference]: Finished difference Result 538 states and 911 transitions. [2024-11-10 15:33:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,355 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-10 15:33:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,357 INFO L225 Difference]: With dead ends: 538 [2024-11-10 15:33:03,357 INFO L226 Difference]: Without dead ends: 538 [2024-11-10 15:33:03,357 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-10 15:33:03,358 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 139 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-10 15:33:03,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-10 15:33:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 399. [2024-11-10 15:33:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.6608040201005025) internal successors, (661), 398 states have internal predecessors, (661), 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-10 15:33:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 661 transitions. [2024-11-10 15:33:03,364 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 661 transitions. Word has length 23 [2024-11-10 15:33:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,364 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 661 transitions. [2024-11-10 15:33:03,364 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-10 15:33:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 661 transitions. [2024-11-10 15:33:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:33:03,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,365 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-10 15:33:03,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:33:03,366 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1976046717, now seen corresponding path program 1 times [2024-11-10 15:33:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093572260] [2024-11-10 15:33:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,396 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-10 15:33:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093572260] [2024-11-10 15:33:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093572260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142446557] [2024-11-10 15:33:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,399 INFO L87 Difference]: Start difference. First operand 399 states and 661 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-10 15:33:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,413 INFO L93 Difference]: Finished difference Result 562 states and 919 transitions. [2024-11-10 15:33:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,414 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-10 15:33:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,416 INFO L225 Difference]: With dead ends: 562 [2024-11-10 15:33:03,416 INFO L226 Difference]: Without dead ends: 562 [2024-11-10 15:33:03,416 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-10 15:33:03,416 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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-10 15:33:03,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-10 15:33:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2024-11-10 15:33:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.6433691756272402) internal successors, (917), 558 states have internal predecessors, (917), 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-10 15:33:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 917 transitions. [2024-11-10 15:33:03,426 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 917 transitions. Word has length 23 [2024-11-10 15:33:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 917 transitions. [2024-11-10 15:33:03,426 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-10 15:33:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 917 transitions. [2024-11-10 15:33:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:33:03,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,428 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-10 15:33:03,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:33:03,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1639289822, now seen corresponding path program 1 times [2024-11-10 15:33:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173446894] [2024-11-10 15:33:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,459 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-10 15:33:03,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173446894] [2024-11-10 15:33:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173446894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765275223] [2024-11-10 15:33:03,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,462 INFO L87 Difference]: Start difference. First operand 559 states and 917 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-10 15:33:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,471 INFO L93 Difference]: Finished difference Result 570 states and 919 transitions. [2024-11-10 15:33:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,472 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-10 15:33:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,473 INFO L225 Difference]: With dead ends: 570 [2024-11-10 15:33:03,474 INFO L226 Difference]: Without dead ends: 570 [2024-11-10 15:33:03,474 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-10 15:33:03,474 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 170 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-10 15:33:03,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-10 15:33:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 567. [2024-11-10 15:33:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.6201413427561837) internal successors, (917), 566 states have internal predecessors, (917), 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-10 15:33:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 917 transitions. [2024-11-10 15:33:03,483 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 917 transitions. Word has length 24 [2024-11-10 15:33:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,484 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 917 transitions. [2024-11-10 15:33:03,485 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-10 15:33:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 917 transitions. [2024-11-10 15:33:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:33:03,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,485 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-10 15:33:03,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:33:03,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1128755645, now seen corresponding path program 1 times [2024-11-10 15:33:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797939977] [2024-11-10 15:33:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,508 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-10 15:33:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797939977] [2024-11-10 15:33:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797939977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550112252] [2024-11-10 15:33:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,511 INFO L87 Difference]: Start difference. First operand 567 states and 917 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-10 15:33:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,523 INFO L93 Difference]: Finished difference Result 1034 states and 1687 transitions. [2024-11-10 15:33:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,524 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-10 15:33:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,528 INFO L225 Difference]: With dead ends: 1034 [2024-11-10 15:33:03,528 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 15:33:03,531 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-10 15:33:03,531 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 137 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-10 15:33:03,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 15:33:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 791. [2024-11-10 15:33:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.5860759493670886) internal successors, (1253), 790 states have internal predecessors, (1253), 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-10 15:33:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1253 transitions. [2024-11-10 15:33:03,545 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1253 transitions. Word has length 24 [2024-11-10 15:33:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,546 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1253 transitions. [2024-11-10 15:33:03,546 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-10 15:33:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1253 transitions. [2024-11-10 15:33:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:33:03,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,547 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-10 15:33:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:33:03,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1658659842, now seen corresponding path program 1 times [2024-11-10 15:33:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411452955] [2024-11-10 15:33:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,567 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-10 15:33:03,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411452955] [2024-11-10 15:33:03,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411452955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402448360] [2024-11-10 15:33:03,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,570 INFO L87 Difference]: Start difference. First operand 791 states and 1253 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-10 15:33:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,586 INFO L93 Difference]: Finished difference Result 1098 states and 1719 transitions. [2024-11-10 15:33:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,586 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-10 15:33:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,589 INFO L225 Difference]: With dead ends: 1098 [2024-11-10 15:33:03,589 INFO L226 Difference]: Without dead ends: 1098 [2024-11-10 15:33:03,590 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-10 15:33:03,590 INFO L432 NwaCegarLoop]: 103 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, 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-10 15:33:03,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-10 15:33:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1095. [2024-11-10 15:33:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.5694698354661791) internal successors, (1717), 1094 states have internal predecessors, (1717), 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-10 15:33:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1717 transitions. [2024-11-10 15:33:03,607 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1717 transitions. Word has length 24 [2024-11-10 15:33:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,607 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1717 transitions. [2024-11-10 15:33:03,607 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-10 15:33:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1717 transitions. [2024-11-10 15:33:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:33:03,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,608 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-10 15:33:03,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:33:03,609 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash 632529462, now seen corresponding path program 1 times [2024-11-10 15:33:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63803595] [2024-11-10 15:33:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,632 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-10 15:33:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63803595] [2024-11-10 15:33:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63803595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605489062] [2024-11-10 15:33:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,634 INFO L87 Difference]: Start difference. First operand 1095 states and 1717 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-10 15:33:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,647 INFO L93 Difference]: Finished difference Result 1114 states and 1719 transitions. [2024-11-10 15:33:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,648 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-10 15:33:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,650 INFO L225 Difference]: With dead ends: 1114 [2024-11-10 15:33:03,650 INFO L226 Difference]: Without dead ends: 1114 [2024-11-10 15:33:03,651 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-10 15:33:03,651 INFO L432 NwaCegarLoop]: 104 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, 166 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-10 15:33:03,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-10 15:33:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1111. [2024-11-10 15:33:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.5468468468468468) internal successors, (1717), 1110 states have internal predecessors, (1717), 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-10 15:33:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1717 transitions. [2024-11-10 15:33:03,667 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1717 transitions. Word has length 25 [2024-11-10 15:33:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1717 transitions. [2024-11-10 15:33:03,667 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-10 15:33:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1717 transitions. [2024-11-10 15:33:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:33:03,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,668 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-10 15:33:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:33:03,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash 121995285, now seen corresponding path program 1 times [2024-11-10 15:33:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765353455] [2024-11-10 15:33:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:33:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765353455] [2024-11-10 15:33:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765353455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936755988] [2024-11-10 15:33:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,698 INFO L87 Difference]: Start difference. First operand 1111 states and 1717 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-10 15:33:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,714 INFO L93 Difference]: Finished difference Result 1994 states and 3111 transitions. [2024-11-10 15:33:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,714 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-10 15:33:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,719 INFO L225 Difference]: With dead ends: 1994 [2024-11-10 15:33:03,719 INFO L226 Difference]: Without dead ends: 1994 [2024-11-10 15:33:03,719 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-10 15:33:03,721 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 135 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-10 15:33:03,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-11-10 15:33:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1575. [2024-11-10 15:33:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.5076238881829733) internal successors, (2373), 1574 states have internal predecessors, (2373), 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-10 15:33:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2373 transitions. [2024-11-10 15:33:03,766 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2373 transitions. Word has length 25 [2024-11-10 15:33:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,766 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2373 transitions. [2024-11-10 15:33:03,766 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-10 15:33:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2373 transitions. [2024-11-10 15:33:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:33:03,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,769 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-10 15:33:03,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:33:03,769 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1629547094, now seen corresponding path program 1 times [2024-11-10 15:33:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239021072] [2024-11-10 15:33:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,793 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-10 15:33:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239021072] [2024-11-10 15:33:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239021072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949088139] [2024-11-10 15:33:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,796 INFO L87 Difference]: Start difference. First operand 1575 states and 2373 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-10 15:33:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,812 INFO L93 Difference]: Finished difference Result 2154 states and 3207 transitions. [2024-11-10 15:33:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,813 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-10 15:33:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,817 INFO L225 Difference]: With dead ends: 2154 [2024-11-10 15:33:03,817 INFO L226 Difference]: Without dead ends: 2154 [2024-11-10 15:33:03,818 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-10 15:33:03,818 INFO L432 NwaCegarLoop]: 105 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, 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-10 15:33:03,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 167 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2024-11-10 15:33:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2151. [2024-11-10 15:33:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2150 states have (on average 1.4906976744186047) internal successors, (3205), 2150 states have internal predecessors, (3205), 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-10 15:33:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3205 transitions. [2024-11-10 15:33:03,860 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3205 transitions. Word has length 25 [2024-11-10 15:33:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3205 transitions. [2024-11-10 15:33:03,861 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-10 15:33:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3205 transitions. [2024-11-10 15:33:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:33:03,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,862 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-10 15:33:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:33:03,863 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -512277353, now seen corresponding path program 1 times [2024-11-10 15:33:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247439774] [2024-11-10 15:33:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,895 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-10 15:33:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247439774] [2024-11-10 15:33:03,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247439774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044521201] [2024-11-10 15:33:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,896 INFO L87 Difference]: Start difference. First operand 2151 states and 3205 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-10 15:33:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,912 INFO L93 Difference]: Finished difference Result 2186 states and 3207 transitions. [2024-11-10 15:33:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,913 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-10 15:33:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,919 INFO L225 Difference]: With dead ends: 2186 [2024-11-10 15:33:03,919 INFO L226 Difference]: Without dead ends: 2186 [2024-11-10 15:33:03,919 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-10 15:33:03,920 INFO L432 NwaCegarLoop]: 101 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, 162 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-10 15:33:03,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-10 15:33:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2183. [2024-11-10 15:33:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 2182 states have (on average 1.4688359303391385) internal successors, (3205), 2182 states have internal predecessors, (3205), 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-10 15:33:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3205 transitions. [2024-11-10 15:33:03,953 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3205 transitions. Word has length 26 [2024-11-10 15:33:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:03,953 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3205 transitions. [2024-11-10 15:33:03,954 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-10 15:33:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3205 transitions. [2024-11-10 15:33:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:33:03,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:03,955 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-10 15:33:03,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:33:03,955 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:03,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1022811530, now seen corresponding path program 1 times [2024-11-10 15:33:03,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:03,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700713295] [2024-11-10 15:33:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:03,970 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-10 15:33:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700713295] [2024-11-10 15:33:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700713295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358683528] [2024-11-10 15:33:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:03,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:03,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:03,972 INFO L87 Difference]: Start difference. First operand 2183 states and 3205 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-10 15:33:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:03,989 INFO L93 Difference]: Finished difference Result 3850 states and 5703 transitions. [2024-11-10 15:33:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:03,989 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-10 15:33:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:03,998 INFO L225 Difference]: With dead ends: 3850 [2024-11-10 15:33:03,998 INFO L226 Difference]: Without dead ends: 3850 [2024-11-10 15:33:03,998 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-10 15:33:03,999 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 133 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-10 15:33:03,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2024-11-10 15:33:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3143. [2024-11-10 15:33:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 3142 states have (on average 1.4274347549331636) internal successors, (4485), 3142 states have internal predecessors, (4485), 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-10 15:33:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4485 transitions. [2024-11-10 15:33:04,041 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4485 transitions. Word has length 26 [2024-11-10 15:33:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,041 INFO L471 AbstractCegarLoop]: Abstraction has 3143 states and 4485 transitions. [2024-11-10 15:33:04,041 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-10 15:33:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4485 transitions. [2024-11-10 15:33:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:33:04,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,044 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-10 15:33:04,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:33:04,044 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 484740279, now seen corresponding path program 1 times [2024-11-10 15:33:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435772128] [2024-11-10 15:33:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,059 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-10 15:33:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435772128] [2024-11-10 15:33:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435772128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406517565] [2024-11-10 15:33:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,061 INFO L87 Difference]: Start difference. First operand 3143 states and 4485 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-10 15:33:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:04,101 INFO L93 Difference]: Finished difference Result 4234 states and 5959 transitions. [2024-11-10 15:33:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:04,101 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-10 15:33:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:04,110 INFO L225 Difference]: With dead ends: 4234 [2024-11-10 15:33:04,110 INFO L226 Difference]: Without dead ends: 4234 [2024-11-10 15:33:04,110 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-10 15:33:04,110 INFO L432 NwaCegarLoop]: 107 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, 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-10 15:33:04,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2024-11-10 15:33:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 4231. [2024-11-10 15:33:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4231 states, 4230 states have (on average 1.408274231678487) internal successors, (5957), 4230 states have internal predecessors, (5957), 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-10 15:33:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4231 states to 4231 states and 5957 transitions. [2024-11-10 15:33:04,155 INFO L78 Accepts]: Start accepts. Automaton has 4231 states and 5957 transitions. Word has length 26 [2024-11-10 15:33:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,155 INFO L471 AbstractCegarLoop]: Abstraction has 4231 states and 5957 transitions. [2024-11-10 15:33:04,155 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-10 15:33:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4231 states and 5957 transitions. [2024-11-10 15:33:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:33:04,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,158 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-10 15:33:04,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:33:04,159 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1641556977, now seen corresponding path program 1 times [2024-11-10 15:33:04,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905390778] [2024-11-10 15:33:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,172 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-10 15:33:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905390778] [2024-11-10 15:33:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905390778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571111042] [2024-11-10 15:33:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,174 INFO L87 Difference]: Start difference. First operand 4231 states and 5957 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-10 15:33:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:04,194 INFO L93 Difference]: Finished difference Result 4298 states and 5959 transitions. [2024-11-10 15:33:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:04,194 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-10 15:33:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:04,204 INFO L225 Difference]: With dead ends: 4298 [2024-11-10 15:33:04,204 INFO L226 Difference]: Without dead ends: 4298 [2024-11-10 15:33:04,204 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-10 15:33:04,204 INFO L432 NwaCegarLoop]: 98 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, 158 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-10 15:33:04,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2024-11-10 15:33:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4295. [2024-11-10 15:33:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.3872845831392642) internal successors, (5957), 4294 states have internal predecessors, (5957), 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-10 15:33:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5957 transitions. [2024-11-10 15:33:04,251 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5957 transitions. Word has length 27 [2024-11-10 15:33:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,252 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 5957 transitions. [2024-11-10 15:33:04,252 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-10 15:33:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5957 transitions. [2024-11-10 15:33:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:33:04,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,255 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-10 15:33:04,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:33:04,255 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2142876142, now seen corresponding path program 1 times [2024-11-10 15:33:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929309931] [2024-11-10 15:33:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,270 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-10 15:33:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929309931] [2024-11-10 15:33:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929309931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822269411] [2024-11-10 15:33:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,271 INFO L87 Difference]: Start difference. First operand 4295 states and 5957 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-10 15:33:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:04,297 INFO L93 Difference]: Finished difference Result 7434 states and 10375 transitions. [2024-11-10 15:33:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:04,297 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-10 15:33:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:04,308 INFO L225 Difference]: With dead ends: 7434 [2024-11-10 15:33:04,308 INFO L226 Difference]: Without dead ends: 7434 [2024-11-10 15:33:04,309 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-10 15:33:04,309 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 34 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 131 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-10 15:33:04,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2024-11-10 15:33:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 6279. [2024-11-10 15:33:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 6278 states have (on average 1.3464479133482001) internal successors, (8453), 6278 states have internal predecessors, (8453), 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-10 15:33:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 8453 transitions. [2024-11-10 15:33:04,391 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 8453 transitions. Word has length 27 [2024-11-10 15:33:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,391 INFO L471 AbstractCegarLoop]: Abstraction has 6279 states and 8453 transitions. [2024-11-10 15:33:04,391 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-10 15:33:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 8453 transitions. [2024-11-10 15:33:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:33:04,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,397 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-10 15:33:04,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:33:04,397 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash -644539345, now seen corresponding path program 1 times [2024-11-10 15:33:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793081521] [2024-11-10 15:33:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,411 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-10 15:33:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793081521] [2024-11-10 15:33:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793081521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023365494] [2024-11-10 15:33:04,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,412 INFO L87 Difference]: Start difference. First operand 6279 states and 8453 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-10 15:33:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:04,434 INFO L93 Difference]: Finished difference Result 8330 states and 11015 transitions. [2024-11-10 15:33:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:04,435 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-10 15:33:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:04,445 INFO L225 Difference]: With dead ends: 8330 [2024-11-10 15:33:04,445 INFO L226 Difference]: Without dead ends: 8330 [2024-11-10 15:33:04,445 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-10 15:33:04,446 INFO L432 NwaCegarLoop]: 109 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, 169 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-10 15:33:04,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2024-11-10 15:33:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 8327. [2024-11-10 15:33:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8327 states, 8326 states have (on average 1.3227239971174634) internal successors, (11013), 8326 states have internal predecessors, (11013), 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-10 15:33:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 11013 transitions. [2024-11-10 15:33:04,531 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 11013 transitions. Word has length 27 [2024-11-10 15:33:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,532 INFO L471 AbstractCegarLoop]: Abstraction has 8327 states and 11013 transitions. [2024-11-10 15:33:04,532 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-10 15:33:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11013 transitions. [2024-11-10 15:33:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:33:04,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,538 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-10 15:33:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:33:04,539 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2005473616, now seen corresponding path program 1 times [2024-11-10 15:33:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126956008] [2024-11-10 15:33:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,553 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-10 15:33:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126956008] [2024-11-10 15:33:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126956008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005237888] [2024-11-10 15:33:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,555 INFO L87 Difference]: Start difference. First operand 8327 states and 11013 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-10 15:33:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:04,576 INFO L93 Difference]: Finished difference Result 8458 states and 11015 transitions. [2024-11-10 15:33:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:04,577 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-10 15:33:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:04,587 INFO L225 Difference]: With dead ends: 8458 [2024-11-10 15:33:04,587 INFO L226 Difference]: Without dead ends: 8458 [2024-11-10 15:33:04,587 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-10 15:33:04,588 INFO L432 NwaCegarLoop]: 95 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, 154 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-10 15:33:04,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2024-11-10 15:33:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 8455. [2024-11-10 15:33:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 8454 states have (on average 1.3026969481902058) internal successors, (11013), 8454 states have internal predecessors, (11013), 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-10 15:33:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 11013 transitions. [2024-11-10 15:33:04,687 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 11013 transitions. Word has length 28 [2024-11-10 15:33:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,687 INFO L471 AbstractCegarLoop]: Abstraction has 8455 states and 11013 transitions. [2024-11-10 15:33:04,688 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-10 15:33:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 11013 transitions. [2024-11-10 15:33:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:33:04,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,694 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-10 15:33:04,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 15:33:04,694 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1494939439, now seen corresponding path program 1 times [2024-11-10 15:33:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214424886] [2024-11-10 15:33:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,708 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-10 15:33:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214424886] [2024-11-10 15:33:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214424886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76448311] [2024-11-10 15:33:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,709 INFO L87 Difference]: Start difference. First operand 8455 states and 11013 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-10 15:33:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:04,738 INFO L93 Difference]: Finished difference Result 14346 states and 18695 transitions. [2024-11-10 15:33:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:04,738 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-10 15:33:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:04,757 INFO L225 Difference]: With dead ends: 14346 [2024-11-10 15:33:04,758 INFO L226 Difference]: Without dead ends: 14346 [2024-11-10 15:33:04,758 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-10 15:33:04,758 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 129 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-10 15:33:04,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14346 states. [2024-11-10 15:33:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14346 to 12551. [2024-11-10 15:33:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12551 states, 12550 states have (on average 1.2650996015936256) internal successors, (15877), 12550 states have internal predecessors, (15877), 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-10 15:33:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12551 states to 12551 states and 15877 transitions. [2024-11-10 15:33:04,954 INFO L78 Accepts]: Start accepts. Automaton has 12551 states and 15877 transitions. Word has length 28 [2024-11-10 15:33:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:04,954 INFO L471 AbstractCegarLoop]: Abstraction has 12551 states and 15877 transitions. [2024-11-10 15:33:04,954 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-10 15:33:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12551 states and 15877 transitions. [2024-11-10 15:33:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:33:04,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:04,968 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-10 15:33:04,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:33:04,968 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1292476048, now seen corresponding path program 1 times [2024-11-10 15:33:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647961022] [2024-11-10 15:33:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:04,986 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-10 15:33:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647961022] [2024-11-10 15:33:04,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647961022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:04,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089058245] [2024-11-10 15:33:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:04,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:04,991 INFO L87 Difference]: Start difference. First operand 12551 states and 15877 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-10 15:33:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:05,068 INFO L93 Difference]: Finished difference Result 16394 states and 20231 transitions. [2024-11-10 15:33:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:05,069 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-10 15:33:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:05,105 INFO L225 Difference]: With dead ends: 16394 [2024-11-10 15:33:05,108 INFO L226 Difference]: Without dead ends: 16394 [2024-11-10 15:33:05,108 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-10 15:33:05,109 INFO L432 NwaCegarLoop]: 111 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, 170 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-10 15:33:05,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16394 states. [2024-11-10 15:33:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16394 to 16391. [2024-11-10 15:33:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16391 states, 16390 states have (on average 1.234228187919463) internal successors, (20229), 16390 states have internal predecessors, (20229), 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-10 15:33:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16391 states to 16391 states and 20229 transitions. [2024-11-10 15:33:05,357 INFO L78 Accepts]: Start accepts. Automaton has 16391 states and 20229 transitions. Word has length 28 [2024-11-10 15:33:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:05,357 INFO L471 AbstractCegarLoop]: Abstraction has 16391 states and 20229 transitions. [2024-11-10 15:33:05,357 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-10 15:33:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16391 states and 20229 transitions. [2024-11-10 15:33:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:33:05,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:05,367 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-10 15:33:05,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:33:05,367 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:05,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash -900701720, now seen corresponding path program 1 times [2024-11-10 15:33:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:05,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117571788] [2024-11-10 15:33:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:05,390 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-10 15:33:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117571788] [2024-11-10 15:33:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117571788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692455058] [2024-11-10 15:33:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:05,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:05,392 INFO L87 Difference]: Start difference. First operand 16391 states and 20229 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-10 15:33:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:05,428 INFO L93 Difference]: Finished difference Result 16650 states and 20231 transitions. [2024-11-10 15:33:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:05,429 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-10 15:33:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:05,450 INFO L225 Difference]: With dead ends: 16650 [2024-11-10 15:33:05,450 INFO L226 Difference]: Without dead ends: 16650 [2024-11-10 15:33:05,451 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-10 15:33:05,451 INFO L432 NwaCegarLoop]: 92 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, 150 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-10 15:33:05,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states. [2024-11-10 15:33:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16650 to 16647. [2024-11-10 15:33:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16647 states, 16646 states have (on average 1.2152469061636428) internal successors, (20229), 16646 states have internal predecessors, (20229), 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-10 15:33:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 20229 transitions. [2024-11-10 15:33:05,683 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 20229 transitions. Word has length 29 [2024-11-10 15:33:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:05,683 INFO L471 AbstractCegarLoop]: Abstraction has 16647 states and 20229 transitions. [2024-11-10 15:33:05,683 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-10 15:33:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 20229 transitions. [2024-11-10 15:33:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:33:05,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:05,693 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-10 15:33:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 15:33:05,693 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:05,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1411235897, now seen corresponding path program 1 times [2024-11-10 15:33:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:05,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794728804] [2024-11-10 15:33:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:05,709 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-10 15:33:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794728804] [2024-11-10 15:33:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794728804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:05,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:05,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:05,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120423045] [2024-11-10 15:33:05,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:05,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:05,712 INFO L87 Difference]: Start difference. First operand 16647 states and 20229 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-10 15:33:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:05,855 INFO L93 Difference]: Finished difference Result 27658 states and 33287 transitions. [2024-11-10 15:33:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:05,856 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-10 15:33:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:05,916 INFO L225 Difference]: With dead ends: 27658 [2024-11-10 15:33:05,916 INFO L226 Difference]: Without dead ends: 27658 [2024-11-10 15:33:05,916 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-10 15:33:05,917 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 127 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-10 15:33:05,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27658 states. [2024-11-10 15:33:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27658 to 25095. [2024-11-10 15:33:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25095 states, 25094 states have (on average 1.183589702717781) internal successors, (29701), 25094 states have internal predecessors, (29701), 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-10 15:33:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25095 states to 25095 states and 29701 transitions. [2024-11-10 15:33:06,342 INFO L78 Accepts]: Start accepts. Automaton has 25095 states and 29701 transitions. Word has length 29 [2024-11-10 15:33:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:06,342 INFO L471 AbstractCegarLoop]: Abstraction has 25095 states and 29701 transitions. [2024-11-10 15:33:06,342 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-10 15:33:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25095 states and 29701 transitions. [2024-11-10 15:33:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:33:06,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:06,367 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-10 15:33:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:33:06,368 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:06,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 96315912, now seen corresponding path program 1 times [2024-11-10 15:33:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506502093] [2024-11-10 15:33:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:06,390 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-10 15:33:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506502093] [2024-11-10 15:33:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506502093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36593984] [2024-11-10 15:33:06,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:06,394 INFO L87 Difference]: Start difference. First operand 25095 states and 29701 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-10 15:33:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:06,623 INFO L93 Difference]: Finished difference Result 32266 states and 36871 transitions. [2024-11-10 15:33:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:06,623 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-10 15:33:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:06,709 INFO L225 Difference]: With dead ends: 32266 [2024-11-10 15:33:06,709 INFO L226 Difference]: Without dead ends: 32266 [2024-11-10 15:33:06,710 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-10 15:33:06,710 INFO L432 NwaCegarLoop]: 113 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, 171 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-10 15:33:06,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32266 states. [2024-11-10 15:33:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32266 to 32263. [2024-11-10 15:33:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32263 states, 32262 states have (on average 1.1427995784514289) internal successors, (36869), 32262 states have internal predecessors, (36869), 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-10 15:33:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32263 states to 32263 states and 36869 transitions. [2024-11-10 15:33:07,036 INFO L78 Accepts]: Start accepts. Automaton has 32263 states and 36869 transitions. Word has length 29 [2024-11-10 15:33:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:07,036 INFO L471 AbstractCegarLoop]: Abstraction has 32263 states and 36869 transitions. [2024-11-10 15:33:07,036 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-10 15:33:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32263 states and 36869 transitions. [2024-11-10 15:33:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:33:07,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:07,058 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, 1] [2024-11-10 15:33:07,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:33:07,059 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:07,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -797830647, now seen corresponding path program 1 times [2024-11-10 15:33:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722557211] [2024-11-10 15:33:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:07,072 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-10 15:33:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722557211] [2024-11-10 15:33:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722557211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909860733] [2024-11-10 15:33:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:07,074 INFO L87 Difference]: Start difference. First operand 32263 states and 36869 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 15:33:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:07,121 INFO L93 Difference]: Finished difference Result 32778 states and 36871 transitions. [2024-11-10 15:33:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-10 15:33:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:07,146 INFO L225 Difference]: With dead ends: 32778 [2024-11-10 15:33:07,146 INFO L226 Difference]: Without dead ends: 32778 [2024-11-10 15:33:07,147 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-10 15:33:07,147 INFO L432 NwaCegarLoop]: 89 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, 146 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-10 15:33:07,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2024-11-10 15:33:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 32775. [2024-11-10 15:33:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 32774 states have (on average 1.124946604015378) internal successors, (36869), 32774 states have internal predecessors, (36869), 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-10 15:33:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 36869 transitions. [2024-11-10 15:33:07,529 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 36869 transitions. Word has length 30 [2024-11-10 15:33:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:07,529 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 36869 transitions. [2024-11-10 15:33:07,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 15:33:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 36869 transitions. [2024-11-10 15:33:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:33:07,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:07,545 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, 1] [2024-11-10 15:33:07,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 15:33:07,546 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:07,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1308364824, now seen corresponding path program 1 times [2024-11-10 15:33:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:07,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363895711] [2024-11-10 15:33:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:07,567 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-10 15:33:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363895711] [2024-11-10 15:33:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363895711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:07,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832532549] [2024-11-10 15:33:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:07,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:07,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:07,569 INFO L87 Difference]: Start difference. First operand 32775 states and 36869 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 15:33:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:07,779 INFO L93 Difference]: Finished difference Result 53255 states and 58373 transitions. [2024-11-10 15:33:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-10 15:33:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:07,851 INFO L225 Difference]: With dead ends: 53255 [2024-11-10 15:33:07,852 INFO L226 Difference]: Without dead ends: 53255 [2024-11-10 15:33:07,852 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-10 15:33:07,853 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 123 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-10 15:33:07,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53255 states. [2024-11-10 15:33:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53255 to 50183. [2024-11-10 15:33:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50183 states, 50182 states have (on average 1.1020086883743174) internal successors, (55301), 50182 states have internal predecessors, (55301), 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-10 15:33:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50183 states to 50183 states and 55301 transitions. [2024-11-10 15:33:08,287 INFO L78 Accepts]: Start accepts. Automaton has 50183 states and 55301 transitions. Word has length 30 [2024-11-10 15:33:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:08,287 INFO L471 AbstractCegarLoop]: Abstraction has 50183 states and 55301 transitions. [2024-11-10 15:33:08,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 15:33:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 50183 states and 55301 transitions. [2024-11-10 15:33:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:33:08,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:33:08,527 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, 1] [2024-11-10 15:33:08,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 15:33:08,527 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:33:08,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:33:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 199186985, now seen corresponding path program 1 times [2024-11-10 15:33:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:33:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787961771] [2024-11-10 15:33:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:33:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:33:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:33:08,541 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-10 15:33:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:33:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787961771] [2024-11-10 15:33:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787961771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:33:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:33:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:33:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112889992] [2024-11-10 15:33:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:33:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:33:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:33:08,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:33:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:33:08,542 INFO L87 Difference]: Start difference. First operand 50183 states and 55301 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 15:33:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:33:08,645 INFO L93 Difference]: Finished difference Result 63492 states and 66563 transitions. [2024-11-10 15:33:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:33:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-10 15:33:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:33:08,646 INFO L225 Difference]: With dead ends: 63492 [2024-11-10 15:33:08,646 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:33:08,647 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-10 15:33:08,647 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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-10 15:33:08,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:33:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:33:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:33:08,647 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-10 15:33:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:33:08,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-10 15:33:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:33:08,648 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:33:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10 15:33:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:33:08,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:33:08,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-10 15:33:08,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-10 15:33:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 15:33:08,653 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, 1] [2024-11-10 15:33:08,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:33:08,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:33:08 BoogieIcfgContainer [2024-11-10 15:33:08,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:33:08,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:33:08,658 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:33:08,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:33:08,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:02" (3/4) ... [2024-11-10 15:33:08,660 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:33:08,667 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 15:33:08,667 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 15:33:08,667 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 15:33:08,667 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:33:08,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:33:08,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:33:08,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:33:08,805 INFO L158 Benchmark]: Toolchain (without parser) took 7223.18ms. Allocated memory was 180.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 113.4MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 434.2MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,805 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:33:08,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.39ms. Allocated memory is still 180.4MB. Free memory was 113.1MB in the beginning and 100.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.32ms. Allocated memory is still 180.4MB. Free memory was 100.0MB in the beginning and 98.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,806 INFO L158 Benchmark]: Boogie Preprocessor took 24.79ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 96.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,806 INFO L158 Benchmark]: IcfgBuilder took 381.32ms. Allocated memory is still 180.4MB. Free memory was 96.4MB in the beginning and 142.1MB in the end (delta: -45.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,806 INFO L158 Benchmark]: TraceAbstraction took 6432.98ms. Allocated memory was 180.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 141.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 438.5MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,807 INFO L158 Benchmark]: Witness Printer took 147.15ms. Allocated memory was 1.7GB in the beginning and 5.0GB in the end (delta: 3.3GB). Free memory was 1.2GB in the beginning and 4.6GB in the end (delta: -3.4GB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 15:33:08,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.39ms. Allocated memory is still 180.4MB. Free memory was 113.1MB in the beginning and 100.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.32ms. Allocated memory is still 180.4MB. Free memory was 100.0MB in the beginning and 98.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.79ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 96.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 381.32ms. Allocated memory is still 180.4MB. Free memory was 96.4MB in the beginning and 142.1MB in the end (delta: -45.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6432.98ms. Allocated memory was 180.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 141.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 438.5MB. Max. memory is 16.1GB. * Witness Printer took 147.15ms. Allocated memory was 1.7GB in the beginning and 5.0GB in the end (delta: 3.3GB). Free memory was 1.2GB in the beginning and 4.6GB in the end (delta: -3.4GB). Peak memory consumption was 21.0MB. 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: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: 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, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1580 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1580 mSDsluCounter, 5112 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1988 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 3124 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50183occurred in iteration=33, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 10303 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 1633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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-10 15:33:08,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE