./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:45:46,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:45:46,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:45:46,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:45:46,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:45:46,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:45:46,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:45:46,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:45:46,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:45:46,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:45:46,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:45:46,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:45:46,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:45:46,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:45:46,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:45:46,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:45:46,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:45:46,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:45:46,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:45:46,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:45:46,657 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:45:46,657 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:45:46,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:45:46,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:45:46,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:45:46,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:45:46,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:45:46,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:45:46,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:45:46,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:45:46,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:45:46,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:45:46,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:45:46,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:45:46,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:45:46,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:45:46,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:45:46,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:45:46,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:45:46,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:45:46,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:45:46,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:45:46,665 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2024-11-12 13:45:46,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:45:46,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:45:46,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:45:46,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:45:46,932 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:45:46,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2024-11-12 13:45:48,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:45:48,514 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:45:48,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2024-11-12 13:45:48,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0731afc7/4118e7e30a4b4b2b920534d866eb189d/FLAGae0227249 [2024-11-12 13:45:48,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0731afc7/4118e7e30a4b4b2b920534d866eb189d [2024-11-12 13:45:48,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:45:48,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:45:48,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:45:48,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:45:48,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:45:48,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:45:48" (1/1) ... [2024-11-12 13:45:48,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c6fbdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:48, skipping insertion in model container [2024-11-12 13:45:48,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:45:48" (1/1) ... [2024-11-12 13:45:48,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:45:49,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:45:49,149 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:45:49,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:45:49,192 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:45:49,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49 WrapperNode [2024-11-12 13:45:49,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:45:49,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:45:49,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:45:49,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:45:49,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,225 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 185 [2024-11-12 13:45:49,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:45:49,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:45:49,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:45:49,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:45:49,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,250 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-12 13:45:49,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:45:49,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:45:49,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:45:49,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:45:49,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (1/1) ... [2024-11-12 13:45:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:45:49,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:45:49,302 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-12 13:45:49,308 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-12 13:45:49,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:45:49,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:45:49,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:45:49,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:45:49,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:45:49,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:45:49,692 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-12 13:45:49,693 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:45:49,706 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:45:49,707 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:45:49,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:45:49 BoogieIcfgContainer [2024-11-12 13:45:49,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:45:49,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:45:49,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:45:49,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:45:49,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:45:48" (1/3) ... [2024-11-12 13:45:49,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6e0a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:45:49, skipping insertion in model container [2024-11-12 13:45:49,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:45:49" (2/3) ... [2024-11-12 13:45:49,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6e0a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:45:49, skipping insertion in model container [2024-11-12 13:45:49,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:45:49" (3/3) ... [2024-11-12 13:45:49,720 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2024-11-12 13:45:49,736 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:45:49,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 13:45:49,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:45:49,779 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;@2b0b716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:45:49,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 13:45:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 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-12 13:45:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:45:49,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:49,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:45:49,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 28705102, now seen corresponding path program 1 times [2024-11-12 13:45:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:49,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289679938] [2024-11-12 13:45:49,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:49,991 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-12 13:45:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289679938] [2024-11-12 13:45:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289679938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:49,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:45:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94241340] [2024-11-12 13:45:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:45:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:45:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:45:50,034 INFO L87 Difference]: Start difference. First operand has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:45:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,047 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2024-11-12 13:45:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:45:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:45:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,054 INFO L225 Difference]: With dead ends: 51 [2024-11-12 13:45:50,054 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 13:45:50,056 INFO L434 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-12 13:45:50,059 INFO L435 NwaCegarLoop]: 89 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, 89 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-12 13:45:50,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 13:45:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 13:45:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.851063829787234) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 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-12 13:45:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 87 transitions. [2024-11-12 13:45:50,085 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 87 transitions. Word has length 5 [2024-11-12 13:45:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,085 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 87 transitions. [2024-11-12 13:45:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:45:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 87 transitions. [2024-11-12 13:45:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:45:50,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:45:50,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:45:50,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash 889699598, now seen corresponding path program 1 times [2024-11-12 13:45:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670473401] [2024-11-12 13:45:50,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,167 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-12 13:45:50,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670473401] [2024-11-12 13:45:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670473401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:45:50,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233454027] [2024-11-12 13:45:50,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,172 INFO L87 Difference]: Start difference. First operand 49 states and 87 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:45:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,182 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2024-11-12 13:45:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:45:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,184 INFO L225 Difference]: With dead ends: 48 [2024-11-12 13:45:50,184 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 13:45:50,184 INFO L434 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-12 13:45:50,186 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 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-12 13:45:50,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 13:45:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 13:45:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 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-12 13:45:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 84 transitions. [2024-11-12 13:45:50,195 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 84 transitions. Word has length 6 [2024-11-12 13:45:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,196 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 84 transitions. [2024-11-12 13:45:50,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:45:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2024-11-12 13:45:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:45:50,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,197 INFO L218 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-12 13:45:50,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:45:50,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 792944727, now seen corresponding path program 1 times [2024-11-12 13:45:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922419278] [2024-11-12 13:45:50,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,316 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-12 13:45:50,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922419278] [2024-11-12 13:45:50,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922419278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400850523] [2024-11-12 13:45:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,319 INFO L87 Difference]: Start difference. First operand 46 states and 84 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-12 13:45:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,349 INFO L93 Difference]: Finished difference Result 89 states and 163 transitions. [2024-11-12 13:45:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,350 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-12 13:45:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,355 INFO L225 Difference]: With dead ends: 89 [2024-11-12 13:45:50,355 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 13:45:50,355 INFO L434 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-12 13:45:50,357 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 166 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-12 13:45:50,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 13:45:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2024-11-12 13:45:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 0 states have call successors, (0), 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-12 13:45:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 111 transitions. [2024-11-12 13:45:50,385 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 111 transitions. Word has length 21 [2024-11-12 13:45:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,385 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 111 transitions. [2024-11-12 13:45:50,385 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-12 13:45:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 111 transitions. [2024-11-12 13:45:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:45:50,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,391 INFO L218 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-12 13:45:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:45:50,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -795403175, now seen corresponding path program 1 times [2024-11-12 13:45:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943836638] [2024-11-12 13:45:50,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,483 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-12 13:45:50,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943836638] [2024-11-12 13:45:50,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943836638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553633894] [2024-11-12 13:45:50,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,487 INFO L87 Difference]: Start difference. First operand 60 states and 111 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-12 13:45:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,518 INFO L93 Difference]: Finished difference Result 89 states and 161 transitions. [2024-11-12 13:45:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,519 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-12 13:45:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,520 INFO L225 Difference]: With dead ends: 89 [2024-11-12 13:45:50,520 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 13:45:50,520 INFO L434 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-12 13:45:50,521 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 187 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-12 13:45:50,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 13:45:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-12 13:45:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 0 states have call successors, (0), 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-12 13:45:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 159 transitions. [2024-11-12 13:45:50,536 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 159 transitions. Word has length 21 [2024-11-12 13:45:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 159 transitions. [2024-11-12 13:45:50,537 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-12 13:45:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 159 transitions. [2024-11-12 13:45:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:45:50,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,540 INFO L218 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-12 13:45:50,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:45:50,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1181940903, now seen corresponding path program 1 times [2024-11-12 13:45:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112080956] [2024-11-12 13:45:50,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,597 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-12 13:45:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112080956] [2024-11-12 13:45:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112080956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411091485] [2024-11-12 13:45:50,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,599 INFO L87 Difference]: Start difference. First operand 86 states and 159 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-12 13:45:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,628 INFO L93 Difference]: Finished difference Result 92 states and 163 transitions. [2024-11-12 13:45:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,629 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-12 13:45:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,629 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:45:50,630 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:45:50,630 INFO L434 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-12 13:45:50,631 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 66 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 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-12 13:45:50,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:45:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-12 13:45:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 0 states have call successors, (0), 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-12 13:45:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 161 transitions. [2024-11-12 13:45:50,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 161 transitions. Word has length 22 [2024-11-12 13:45:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,649 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 161 transitions. [2024-11-12 13:45:50,649 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-12 13:45:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 161 transitions. [2024-11-12 13:45:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:45:50,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,650 INFO L218 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-12 13:45:50,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:45:50,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1118881687, now seen corresponding path program 1 times [2024-11-12 13:45:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070712420] [2024-11-12 13:45:50,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,691 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-12 13:45:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070712420] [2024-11-12 13:45:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070712420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013818286] [2024-11-12 13:45:50,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,693 INFO L87 Difference]: Start difference. First operand 89 states and 161 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-12 13:45:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,710 INFO L93 Difference]: Finished difference Result 169 states and 308 transitions. [2024-11-12 13:45:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,711 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-12 13:45:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,712 INFO L225 Difference]: With dead ends: 169 [2024-11-12 13:45:50,712 INFO L226 Difference]: Without dead ends: 169 [2024-11-12 13:45:50,713 INFO L434 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-12 13:45:50,713 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 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-12 13:45:50,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-12 13:45:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 118. [2024-11-12 13:45:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 0 states have call successors, (0), 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-12 13:45:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 214 transitions. [2024-11-12 13:45:50,729 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 214 transitions. Word has length 22 [2024-11-12 13:45:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,732 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 214 transitions. [2024-11-12 13:45:50,733 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-12 13:45:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 214 transitions. [2024-11-12 13:45:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:45:50,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,734 INFO L218 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-12 13:45:50,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:45:50,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -469466215, now seen corresponding path program 1 times [2024-11-12 13:45:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381743911] [2024-11-12 13:45:50,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,772 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-12 13:45:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381743911] [2024-11-12 13:45:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381743911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164686763] [2024-11-12 13:45:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,775 INFO L87 Difference]: Start difference. First operand 118 states and 214 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-12 13:45:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,788 INFO L93 Difference]: Finished difference Result 171 states and 306 transitions. [2024-11-12 13:45:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,788 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-12 13:45:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,789 INFO L225 Difference]: With dead ends: 171 [2024-11-12 13:45:50,789 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:45:50,790 INFO L434 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-12 13:45:50,791 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 188 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-12 13:45:50,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:45:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-11-12 13:45:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 0 states have call successors, (0), 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-12 13:45:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 304 transitions. [2024-11-12 13:45:50,800 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 304 transitions. Word has length 22 [2024-11-12 13:45:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,800 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 304 transitions. [2024-11-12 13:45:50,801 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-12 13:45:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 304 transitions. [2024-11-12 13:45:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:45:50,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,802 INFO L218 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-12 13:45:50,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:45:50,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 332180836, now seen corresponding path program 1 times [2024-11-12 13:45:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795442099] [2024-11-12 13:45:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,865 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-12 13:45:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795442099] [2024-11-12 13:45:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795442099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178620185] [2024-11-12 13:45:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,868 INFO L87 Difference]: Start difference. First operand 168 states and 304 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-12 13:45:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,886 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2024-11-12 13:45:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,887 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-12 13:45:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,889 INFO L225 Difference]: With dead ends: 173 [2024-11-12 13:45:50,889 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 13:45:50,889 INFO L434 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-12 13:45:50,890 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 207 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-12 13:45:50,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 13:45:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-12 13:45:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 0 states have call successors, (0), 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-12 13:45:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 304 transitions. [2024-11-12 13:45:50,897 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 304 transitions. Word has length 23 [2024-11-12 13:45:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 304 transitions. [2024-11-12 13:45:50,898 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-12 13:45:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 304 transitions. [2024-11-12 13:45:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:45:50,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,899 INFO L218 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-12 13:45:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:45:50,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1661963870, now seen corresponding path program 1 times [2024-11-12 13:45:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661156938] [2024-11-12 13:45:50,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:50,943 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-12 13:45:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661156938] [2024-11-12 13:45:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661156938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:50,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966865305] [2024-11-12 13:45:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:50,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:50,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:50,945 INFO L87 Difference]: Start difference. First operand 170 states and 304 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-12 13:45:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:50,960 INFO L93 Difference]: Finished difference Result 329 states and 582 transitions. [2024-11-12 13:45:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:50,961 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-12 13:45:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:50,962 INFO L225 Difference]: With dead ends: 329 [2024-11-12 13:45:50,962 INFO L226 Difference]: Without dead ends: 329 [2024-11-12 13:45:50,963 INFO L434 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-12 13:45:50,963 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 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-12 13:45:50,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-12 13:45:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2024-11-12 13:45:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 0 states have call successors, (0), 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-12 13:45:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 580 transitions. [2024-11-12 13:45:50,980 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 580 transitions. Word has length 23 [2024-11-12 13:45:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:50,981 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 580 transitions. [2024-11-12 13:45:50,981 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-12 13:45:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 580 transitions. [2024-11-12 13:45:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:45:50,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:50,986 INFO L218 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-12 13:45:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:45:50,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -73615968, now seen corresponding path program 1 times [2024-11-12 13:45:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259517607] [2024-11-12 13:45:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,028 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-12 13:45:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259517607] [2024-11-12 13:45:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259517607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518285957] [2024-11-12 13:45:51,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,030 INFO L87 Difference]: Start difference. First operand 326 states and 580 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-12 13:45:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,044 INFO L93 Difference]: Finished difference Result 417 states and 746 transitions. [2024-11-12 13:45:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,045 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-12 13:45:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,046 INFO L225 Difference]: With dead ends: 417 [2024-11-12 13:45:51,046 INFO L226 Difference]: Without dead ends: 417 [2024-11-12 13:45:51,047 INFO L434 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-12 13:45:51,047 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:45:51,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 227 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-12 13:45:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 326. [2024-11-12 13:45:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 0 states have call successors, (0), 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-12 13:45:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 576 transitions. [2024-11-12 13:45:51,059 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 576 transitions. Word has length 23 [2024-11-12 13:45:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,059 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 576 transitions. [2024-11-12 13:45:51,059 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-12 13:45:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 576 transitions. [2024-11-12 13:45:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:45:51,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,060 INFO L218 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-12 13:45:51,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:45:51,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash 25325060, now seen corresponding path program 1 times [2024-11-12 13:45:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006442148] [2024-11-12 13:45:51,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:45:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006442148] [2024-11-12 13:45:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006442148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999107075] [2024-11-12 13:45:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,123 INFO L87 Difference]: Start difference. First operand 326 states and 576 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-12 13:45:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,141 INFO L93 Difference]: Finished difference Result 613 states and 1090 transitions. [2024-11-12 13:45:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,142 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-12 13:45:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,145 INFO L225 Difference]: With dead ends: 613 [2024-11-12 13:45:51,145 INFO L226 Difference]: Without dead ends: 613 [2024-11-12 13:45:51,145 INFO L434 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-12 13:45:51,147 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 55 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 160 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-12 13:45:51,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-12 13:45:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 450. [2024-11-12 13:45:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 0 states have call successors, (0), 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-12 13:45:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 784 transitions. [2024-11-12 13:45:51,160 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 784 transitions. Word has length 24 [2024-11-12 13:45:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,161 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 784 transitions. [2024-11-12 13:45:51,161 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-12 13:45:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 784 transitions. [2024-11-12 13:45:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:45:51,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,163 INFO L218 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-12 13:45:51,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:45:51,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1563022842, now seen corresponding path program 1 times [2024-11-12 13:45:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670907246] [2024-11-12 13:45:51,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,201 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-12 13:45:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670907246] [2024-11-12 13:45:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670907246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410289178] [2024-11-12 13:45:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,203 INFO L87 Difference]: Start difference. First operand 450 states and 784 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-12 13:45:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,221 INFO L93 Difference]: Finished difference Result 637 states and 1102 transitions. [2024-11-12 13:45:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,221 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-12 13:45:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,225 INFO L225 Difference]: With dead ends: 637 [2024-11-12 13:45:51,225 INFO L226 Difference]: Without dead ends: 637 [2024-11-12 13:45:51,226 INFO L434 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-12 13:45:51,227 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 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-12 13:45:51,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-12 13:45:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-12 13:45:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 0 states have call successors, (0), 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-12 13:45:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1100 transitions. [2024-11-12 13:45:51,244 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1100 transitions. Word has length 24 [2024-11-12 13:45:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 1100 transitions. [2024-11-12 13:45:51,245 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-12 13:45:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1100 transitions. [2024-11-12 13:45:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:45:51,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,248 INFO L218 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-12 13:45:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:45:51,248 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 791684909, now seen corresponding path program 1 times [2024-11-12 13:45:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364680141] [2024-11-12 13:45:51,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,281 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-12 13:45:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364680141] [2024-11-12 13:45:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364680141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398349491] [2024-11-12 13:45:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,284 INFO L87 Difference]: Start difference. First operand 634 states and 1100 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-12 13:45:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,302 INFO L93 Difference]: Finished difference Result 649 states and 1110 transitions. [2024-11-12 13:45:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,303 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-12 13:45:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,306 INFO L225 Difference]: With dead ends: 649 [2024-11-12 13:45:51,306 INFO L226 Difference]: Without dead ends: 649 [2024-11-12 13:45:51,306 INFO L434 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-12 13:45:51,307 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 199 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-12 13:45:51,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-12 13:45:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-12 13:45:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 0 states have call successors, (0), 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-12 13:45:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1108 transitions. [2024-11-12 13:45:51,325 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1108 transitions. Word has length 25 [2024-11-12 13:45:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,325 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 1108 transitions. [2024-11-12 13:45:51,326 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-12 13:45:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1108 transitions. [2024-11-12 13:45:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:45:51,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,327 INFO L218 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-12 13:45:51,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:45:51,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1202459797, now seen corresponding path program 1 times [2024-11-12 13:45:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117101229] [2024-11-12 13:45:51,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,360 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-12 13:45:51,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117101229] [2024-11-12 13:45:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117101229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142360097] [2024-11-12 13:45:51,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,363 INFO L87 Difference]: Start difference. First operand 646 states and 1108 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-12 13:45:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,385 INFO L93 Difference]: Finished difference Result 1193 states and 2062 transitions. [2024-11-12 13:45:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,386 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-12 13:45:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,391 INFO L225 Difference]: With dead ends: 1193 [2024-11-12 13:45:51,391 INFO L226 Difference]: Without dead ends: 1193 [2024-11-12 13:45:51,391 INFO L434 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-12 13:45:51,392 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 52 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 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-12 13:45:51,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-12 13:45:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 902. [2024-11-12 13:45:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 0 states have call successors, (0), 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-12 13:45:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1516 transitions. [2024-11-12 13:45:51,413 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1516 transitions. Word has length 25 [2024-11-12 13:45:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,415 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1516 transitions. [2024-11-12 13:45:51,415 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-12 13:45:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1516 transitions. [2024-11-12 13:45:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:45:51,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,417 INFO L218 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-12 13:45:51,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:45:51,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1504159597, now seen corresponding path program 1 times [2024-11-12 13:45:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203918464] [2024-11-12 13:45:51,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,454 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-12 13:45:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203918464] [2024-11-12 13:45:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203918464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018939521] [2024-11-12 13:45:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,457 INFO L87 Difference]: Start difference. First operand 902 states and 1516 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-12 13:45:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,474 INFO L93 Difference]: Finished difference Result 1257 states and 2102 transitions. [2024-11-12 13:45:51,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,475 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-12 13:45:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,479 INFO L225 Difference]: With dead ends: 1257 [2024-11-12 13:45:51,480 INFO L226 Difference]: Without dead ends: 1257 [2024-11-12 13:45:51,480 INFO L434 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-12 13:45:51,481 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 191 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-12 13:45:51,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-12 13:45:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1254. [2024-11-12 13:45:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 0 states have call successors, (0), 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-12 13:45:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2100 transitions. [2024-11-12 13:45:51,512 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2100 transitions. Word has length 25 [2024-11-12 13:45:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,512 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 2100 transitions. [2024-11-12 13:45:51,513 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-12 13:45:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2100 transitions. [2024-11-12 13:45:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:45:51,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,516 INFO L218 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-12 13:45:51,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:45:51,516 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1385070577, now seen corresponding path program 1 times [2024-11-12 13:45:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920065279] [2024-11-12 13:45:51,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,548 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-12 13:45:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920065279] [2024-11-12 13:45:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920065279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256492177] [2024-11-12 13:45:51,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,552 INFO L87 Difference]: Start difference. First operand 1254 states and 2100 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-12 13:45:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,568 INFO L93 Difference]: Finished difference Result 1273 states and 2102 transitions. [2024-11-12 13:45:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,568 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-12 13:45:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,573 INFO L225 Difference]: With dead ends: 1273 [2024-11-12 13:45:51,573 INFO L226 Difference]: Without dead ends: 1273 [2024-11-12 13:45:51,573 INFO L434 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-12 13:45:51,574 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 195 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-12 13:45:51,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2024-11-12 13:45:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1270. [2024-11-12 13:45:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 0 states have call successors, (0), 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-12 13:45:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2100 transitions. [2024-11-12 13:45:51,601 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2100 transitions. Word has length 26 [2024-11-12 13:45:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 2100 transitions. [2024-11-12 13:45:51,602 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-12 13:45:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2100 transitions. [2024-11-12 13:45:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:45:51,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,603 INFO L218 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-12 13:45:51,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:45:51,604 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -609074129, now seen corresponding path program 1 times [2024-11-12 13:45:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516013918] [2024-11-12 13:45:51,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:45:51,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516013918] [2024-11-12 13:45:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516013918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908333281] [2024-11-12 13:45:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,637 INFO L87 Difference]: Start difference. First operand 1270 states and 2100 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-12 13:45:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,654 INFO L93 Difference]: Finished difference Result 2313 states and 3862 transitions. [2024-11-12 13:45:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,655 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-12 13:45:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,663 INFO L225 Difference]: With dead ends: 2313 [2024-11-12 13:45:51,663 INFO L226 Difference]: Without dead ends: 2313 [2024-11-12 13:45:51,664 INFO L434 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-12 13:45:51,665 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 49 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 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-12 13:45:51,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-11-12 13:45:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1798. [2024-11-12 13:45:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 0 states have call successors, (0), 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-12 13:45:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2900 transitions. [2024-11-12 13:45:51,729 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2900 transitions. Word has length 26 [2024-11-12 13:45:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,729 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2900 transitions. [2024-11-12 13:45:51,729 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-12 13:45:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2900 transitions. [2024-11-12 13:45:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:45:51,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,732 INFO L218 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-12 13:45:51,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:45:51,732 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2097545265, now seen corresponding path program 1 times [2024-11-12 13:45:51,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393695412] [2024-11-12 13:45:51,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,763 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-12 13:45:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393695412] [2024-11-12 13:45:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393695412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887274042] [2024-11-12 13:45:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,765 INFO L87 Difference]: Start difference. First operand 1798 states and 2900 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-12 13:45:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,788 INFO L93 Difference]: Finished difference Result 2473 states and 3974 transitions. [2024-11-12 13:45:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,788 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-12 13:45:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,797 INFO L225 Difference]: With dead ends: 2473 [2024-11-12 13:45:51,797 INFO L226 Difference]: Without dead ends: 2473 [2024-11-12 13:45:51,797 INFO L434 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-12 13:45:51,798 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 192 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-12 13:45:51,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-11-12 13:45:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2470. [2024-11-12 13:45:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 0 states have call successors, (0), 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-12 13:45:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3972 transitions. [2024-11-12 13:45:51,855 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3972 transitions. Word has length 26 [2024-11-12 13:45:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,855 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3972 transitions. [2024-11-12 13:45:51,855 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-12 13:45:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3972 transitions. [2024-11-12 13:45:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:45:51,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,858 INFO L218 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-12 13:45:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:45:51,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1694799624, now seen corresponding path program 1 times [2024-11-12 13:45:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246432734] [2024-11-12 13:45:51,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,887 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-12 13:45:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246432734] [2024-11-12 13:45:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246432734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556980151] [2024-11-12 13:45:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,889 INFO L87 Difference]: Start difference. First operand 2470 states and 3972 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-12 13:45:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:51,910 INFO L93 Difference]: Finished difference Result 2505 states and 3974 transitions. [2024-11-12 13:45:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:51,910 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-12 13:45:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:51,917 INFO L225 Difference]: With dead ends: 2505 [2024-11-12 13:45:51,918 INFO L226 Difference]: Without dead ends: 2505 [2024-11-12 13:45:51,918 INFO L434 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-12 13:45:51,918 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 191 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-12 13:45:51,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-12 13:45:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2502. [2024-11-12 13:45:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 0 states have call successors, (0), 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-12 13:45:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3972 transitions. [2024-11-12 13:45:51,965 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3972 transitions. Word has length 27 [2024-11-12 13:45:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:51,965 INFO L471 AbstractCegarLoop]: Abstraction has 2502 states and 3972 transitions. [2024-11-12 13:45:51,965 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-12 13:45:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3972 transitions. [2024-11-12 13:45:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:45:51,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:51,968 INFO L218 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-12 13:45:51,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:45:51,968 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:51,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash 606022966, now seen corresponding path program 1 times [2024-11-12 13:45:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:51,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866264615] [2024-11-12 13:45:51,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:51,992 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-12 13:45:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866264615] [2024-11-12 13:45:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866264615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:51,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:51,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836247237] [2024-11-12 13:45:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:51,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:51,995 INFO L87 Difference]: Start difference. First operand 2502 states and 3972 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-12 13:45:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:52,023 INFO L93 Difference]: Finished difference Result 4489 states and 7206 transitions. [2024-11-12 13:45:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:52,023 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-12 13:45:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:52,036 INFO L225 Difference]: With dead ends: 4489 [2024-11-12 13:45:52,036 INFO L226 Difference]: Without dead ends: 4489 [2024-11-12 13:45:52,036 INFO L434 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-12 13:45:52,037 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 154 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-12 13:45:52,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2024-11-12 13:45:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 3590. [2024-11-12 13:45:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 0 states have call successors, (0), 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-12 13:45:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5540 transitions. [2024-11-12 13:45:52,100 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5540 transitions. Word has length 27 [2024-11-12 13:45:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 3590 states and 5540 transitions. [2024-11-12 13:45:52,100 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-12 13:45:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5540 transitions. [2024-11-12 13:45:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:45:52,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:52,105 INFO L218 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-12 13:45:52,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:45:52,105 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:52,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -982324936, now seen corresponding path program 1 times [2024-11-12 13:45:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879600234] [2024-11-12 13:45:52,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:52,127 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-12 13:45:52,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:52,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879600234] [2024-11-12 13:45:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879600234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:52,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026112967] [2024-11-12 13:45:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:52,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:52,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:52,129 INFO L87 Difference]: Start difference. First operand 3590 states and 5540 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-12 13:45:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:52,193 INFO L93 Difference]: Finished difference Result 4873 states and 7494 transitions. [2024-11-12 13:45:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:52,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-12 13:45:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:52,212 INFO L225 Difference]: With dead ends: 4873 [2024-11-12 13:45:52,212 INFO L226 Difference]: Without dead ends: 4873 [2024-11-12 13:45:52,212 INFO L434 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-12 13:45:52,213 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 193 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-12 13:45:52,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-12 13:45:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4870. [2024-11-12 13:45:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4870 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 0 states have call successors, (0), 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-12 13:45:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 7492 transitions. [2024-11-12 13:45:52,302 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 7492 transitions. Word has length 27 [2024-11-12 13:45:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:52,302 INFO L471 AbstractCegarLoop]: Abstraction has 4870 states and 7492 transitions. [2024-11-12 13:45:52,302 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-12 13:45:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 7492 transitions. [2024-11-12 13:45:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:45:52,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:52,307 INFO L218 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-12 13:45:52,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:45:52,308 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:52,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1613482524, now seen corresponding path program 1 times [2024-11-12 13:45:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:52,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460775024] [2024-11-12 13:45:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:52,334 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-12 13:45:52,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460775024] [2024-11-12 13:45:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460775024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:52,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798620521] [2024-11-12 13:45:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:52,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:52,337 INFO L87 Difference]: Start difference. First operand 4870 states and 7492 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-12 13:45:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:52,363 INFO L93 Difference]: Finished difference Result 4937 states and 7494 transitions. [2024-11-12 13:45:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:52,365 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-12 13:45:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:52,382 INFO L225 Difference]: With dead ends: 4937 [2024-11-12 13:45:52,382 INFO L226 Difference]: Without dead ends: 4937 [2024-11-12 13:45:52,382 INFO L434 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-12 13:45:52,382 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 187 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-12 13:45:52,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2024-11-12 13:45:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4934. [2024-11-12 13:45:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 0 states have call successors, (0), 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-12 13:45:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 7492 transitions. [2024-11-12 13:45:52,464 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 7492 transitions. Word has length 28 [2024-11-12 13:45:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:52,465 INFO L471 AbstractCegarLoop]: Abstraction has 4934 states and 7492 transitions. [2024-11-12 13:45:52,465 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-12 13:45:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 7492 transitions. [2024-11-12 13:45:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:45:52,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:52,471 INFO L218 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-12 13:45:52,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:45:52,471 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -380662182, now seen corresponding path program 1 times [2024-11-12 13:45:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971763452] [2024-11-12 13:45:52,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:52,497 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-12 13:45:52,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971763452] [2024-11-12 13:45:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971763452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893951594] [2024-11-12 13:45:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:52,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:52,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:52,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:52,501 INFO L87 Difference]: Start difference. First operand 4934 states and 7492 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-12 13:45:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:52,541 INFO L93 Difference]: Finished difference Result 8713 states and 13382 transitions. [2024-11-12 13:45:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:52,542 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-12 13:45:52,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:52,564 INFO L225 Difference]: With dead ends: 8713 [2024-11-12 13:45:52,564 INFO L226 Difference]: Without dead ends: 8713 [2024-11-12 13:45:52,565 INFO L434 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-12 13:45:52,565 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 152 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-12 13:45:52,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8713 states. [2024-11-12 13:45:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8713 to 7174. [2024-11-12 13:45:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7174 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 0 states have call successors, (0), 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-12 13:45:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7174 states to 7174 states and 10564 transitions. [2024-11-12 13:45:52,732 INFO L78 Accepts]: Start accepts. Automaton has 7174 states and 10564 transitions. Word has length 28 [2024-11-12 13:45:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:52,732 INFO L471 AbstractCegarLoop]: Abstraction has 7174 states and 10564 transitions. [2024-11-12 13:45:52,733 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-12 13:45:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7174 states and 10564 transitions. [2024-11-12 13:45:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:45:52,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:52,741 INFO L218 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-12 13:45:52,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:45:52,742 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:52,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1969010084, now seen corresponding path program 1 times [2024-11-12 13:45:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796764879] [2024-11-12 13:45:52,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:52,762 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-12 13:45:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796764879] [2024-11-12 13:45:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796764879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:52,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:52,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:52,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024420646] [2024-11-12 13:45:52,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:52,765 INFO L87 Difference]: Start difference. First operand 7174 states and 10564 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-12 13:45:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:52,802 INFO L93 Difference]: Finished difference Result 9609 states and 14086 transitions. [2024-11-12 13:45:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:52,802 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-12 13:45:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:52,818 INFO L225 Difference]: With dead ends: 9609 [2024-11-12 13:45:52,818 INFO L226 Difference]: Without dead ends: 9609 [2024-11-12 13:45:52,818 INFO L434 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-12 13:45:52,819 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 194 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-12 13:45:52,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9609 states. [2024-11-12 13:45:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9609 to 9606. [2024-11-12 13:45:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9606 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 0 states have call successors, (0), 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-12 13:45:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9606 states to 9606 states and 14084 transitions. [2024-11-12 13:45:53,015 INFO L78 Accepts]: Start accepts. Automaton has 9606 states and 14084 transitions. Word has length 28 [2024-11-12 13:45:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:53,015 INFO L471 AbstractCegarLoop]: Abstraction has 9606 states and 14084 transitions. [2024-11-12 13:45:53,015 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-12 13:45:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 9606 states and 14084 transitions. [2024-11-12 13:45:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:45:53,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:53,027 INFO L218 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-12 13:45:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:45:53,027 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1091024579, now seen corresponding path program 1 times [2024-11-12 13:45:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122228790] [2024-11-12 13:45:53,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:45:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122228790] [2024-11-12 13:45:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122228790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443585962] [2024-11-12 13:45:53,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:53,069 INFO L87 Difference]: Start difference. First operand 9606 states and 14084 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-12 13:45:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:53,109 INFO L93 Difference]: Finished difference Result 9737 states and 14086 transitions. [2024-11-12 13:45:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:53,109 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-12 13:45:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:53,128 INFO L225 Difference]: With dead ends: 9737 [2024-11-12 13:45:53,129 INFO L226 Difference]: Without dead ends: 9737 [2024-11-12 13:45:53,129 INFO L434 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-12 13:45:53,129 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 183 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-12 13:45:53,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9737 states. [2024-11-12 13:45:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9737 to 9734. [2024-11-12 13:45:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9734 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 0 states have call successors, (0), 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-12 13:45:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 14084 transitions. [2024-11-12 13:45:53,304 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 14084 transitions. Word has length 29 [2024-11-12 13:45:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:53,305 INFO L471 AbstractCegarLoop]: Abstraction has 9734 states and 14084 transitions. [2024-11-12 13:45:53,305 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-12 13:45:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 14084 transitions. [2024-11-12 13:45:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:45:53,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:53,315 INFO L218 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-12 13:45:53,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:45:53,315 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -903120127, now seen corresponding path program 1 times [2024-11-12 13:45:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:53,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736165658] [2024-11-12 13:45:53,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:53,347 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-12 13:45:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736165658] [2024-11-12 13:45:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736165658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369543062] [2024-11-12 13:45:53,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:53,349 INFO L87 Difference]: Start difference. First operand 9734 states and 14084 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-12 13:45:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:53,394 INFO L93 Difference]: Finished difference Result 16905 states and 24710 transitions. [2024-11-12 13:45:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:53,395 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-12 13:45:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:53,425 INFO L225 Difference]: With dead ends: 16905 [2024-11-12 13:45:53,425 INFO L226 Difference]: Without dead ends: 16905 [2024-11-12 13:45:53,425 INFO L434 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-12 13:45:53,426 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 150 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-12 13:45:53,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16905 states. [2024-11-12 13:45:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16905 to 14342. [2024-11-12 13:45:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14342 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 0 states have call successors, (0), 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-12 13:45:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14342 states to 14342 states and 20100 transitions. [2024-11-12 13:45:53,672 INFO L78 Accepts]: Start accepts. Automaton has 14342 states and 20100 transitions. Word has length 29 [2024-11-12 13:45:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:53,672 INFO L471 AbstractCegarLoop]: Abstraction has 14342 states and 20100 transitions. [2024-11-12 13:45:53,672 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-12 13:45:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 14342 states and 20100 transitions. [2024-11-12 13:45:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:45:53,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:53,689 INFO L218 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-12 13:45:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 13:45:53,689 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1803499267, now seen corresponding path program 1 times [2024-11-12 13:45:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894234869] [2024-11-12 13:45:53,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:53,717 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-12 13:45:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894234869] [2024-11-12 13:45:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894234869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657643040] [2024-11-12 13:45:53,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:53,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:53,719 INFO L87 Difference]: Start difference. First operand 14342 states and 20100 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-12 13:45:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:53,772 INFO L93 Difference]: Finished difference Result 18953 states and 26374 transitions. [2024-11-12 13:45:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:53,772 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-12 13:45:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:53,805 INFO L225 Difference]: With dead ends: 18953 [2024-11-12 13:45:53,805 INFO L226 Difference]: Without dead ends: 18953 [2024-11-12 13:45:53,805 INFO L434 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-12 13:45:53,806 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 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-12 13:45:53,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18953 states. [2024-11-12 13:45:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18953 to 18950. [2024-11-12 13:45:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18950 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 0 states have call successors, (0), 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-12 13:45:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18950 states to 18950 states and 26372 transitions. [2024-11-12 13:45:54,085 INFO L78 Accepts]: Start accepts. Automaton has 18950 states and 26372 transitions. Word has length 29 [2024-11-12 13:45:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:54,085 INFO L471 AbstractCegarLoop]: Abstraction has 18950 states and 26372 transitions. [2024-11-12 13:45:54,085 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-12 13:45:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18950 states and 26372 transitions. [2024-11-12 13:45:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:45:54,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:54,099 INFO L218 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-12 13:45:54,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 13:45:54,099 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2074708039, now seen corresponding path program 1 times [2024-11-12 13:45:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664660400] [2024-11-12 13:45:54,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:54,118 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-12 13:45:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664660400] [2024-11-12 13:45:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664660400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634035816] [2024-11-12 13:45:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:54,120 INFO L87 Difference]: Start difference. First operand 18950 states and 26372 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-12 13:45:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:54,172 INFO L93 Difference]: Finished difference Result 19209 states and 26374 transitions. [2024-11-12 13:45:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:54,172 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-12 13:45:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:54,206 INFO L225 Difference]: With dead ends: 19209 [2024-11-12 13:45:54,206 INFO L226 Difference]: Without dead ends: 19209 [2024-11-12 13:45:54,206 INFO L434 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-12 13:45:54,207 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:45:54,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19209 states. [2024-11-12 13:45:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19209 to 19206. [2024-11-12 13:45:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19206 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 0 states have call successors, (0), 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-12 13:45:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19206 states to 19206 states and 26372 transitions. [2024-11-12 13:45:54,660 INFO L78 Accepts]: Start accepts. Automaton has 19206 states and 26372 transitions. Word has length 30 [2024-11-12 13:45:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:54,661 INFO L471 AbstractCegarLoop]: Abstraction has 19206 states and 26372 transitions. [2024-11-12 13:45:54,661 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-12 13:45:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 19206 states and 26372 transitions. [2024-11-12 13:45:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:45:54,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:54,678 INFO L218 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-12 13:45:54,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 13:45:54,679 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 80563333, now seen corresponding path program 1 times [2024-11-12 13:45:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:54,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094986748] [2024-11-12 13:45:54,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:54,714 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-12 13:45:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094986748] [2024-11-12 13:45:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094986748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215192132] [2024-11-12 13:45:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:54,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:54,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:54,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:54,716 INFO L87 Difference]: Start difference. First operand 19206 states and 26372 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-12 13:45:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:54,818 INFO L93 Difference]: Finished difference Result 32777 states and 45318 transitions. [2024-11-12 13:45:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:54,819 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-12 13:45:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:54,884 INFO L225 Difference]: With dead ends: 32777 [2024-11-12 13:45:54,885 INFO L226 Difference]: Without dead ends: 32777 [2024-11-12 13:45:54,885 INFO L434 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-12 13:45:54,885 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 148 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-12 13:45:54,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32777 states. [2024-11-12 13:45:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32777 to 28678. [2024-11-12 13:45:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28678 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 0 states have call successors, (0), 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-12 13:45:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28678 states to 28678 states and 38148 transitions. [2024-11-12 13:45:55,458 INFO L78 Accepts]: Start accepts. Automaton has 28678 states and 38148 transitions. Word has length 30 [2024-11-12 13:45:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:55,458 INFO L471 AbstractCegarLoop]: Abstraction has 28678 states and 38148 transitions. [2024-11-12 13:45:55,458 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-12 13:45:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28678 states and 38148 transitions. [2024-11-12 13:45:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:45:55,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:55,481 INFO L218 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-12 13:45:55,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 13:45:55,481 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:55,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1507784569, now seen corresponding path program 1 times [2024-11-12 13:45:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890364647] [2024-11-12 13:45:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:55,682 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-12 13:45:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890364647] [2024-11-12 13:45:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890364647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159751450] [2024-11-12 13:45:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:55,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:55,684 INFO L87 Difference]: Start difference. First operand 28678 states and 38148 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-12 13:45:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:55,782 INFO L93 Difference]: Finished difference Result 37385 states and 49158 transitions. [2024-11-12 13:45:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:55,782 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-12 13:45:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:55,839 INFO L225 Difference]: With dead ends: 37385 [2024-11-12 13:45:55,839 INFO L226 Difference]: Without dead ends: 37385 [2024-11-12 13:45:55,840 INFO L434 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-12 13:45:55,841 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 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-12 13:45:55,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37385 states. [2024-11-12 13:45:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37385 to 37382. [2024-11-12 13:45:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37382 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 0 states have call successors, (0), 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-12 13:45:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37382 states to 37382 states and 49156 transitions. [2024-11-12 13:45:56,508 INFO L78 Accepts]: Start accepts. Automaton has 37382 states and 49156 transitions. Word has length 30 [2024-11-12 13:45:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 37382 states and 49156 transitions. [2024-11-12 13:45:56,508 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-12 13:45:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37382 states and 49156 transitions. [2024-11-12 13:45:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:45:56,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:56,539 INFO L218 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, 1] [2024-11-12 13:45:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 13:45:56,539 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1790832498, now seen corresponding path program 1 times [2024-11-12 13:45:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317449246] [2024-11-12 13:45:56,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:56,564 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-12 13:45:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317449246] [2024-11-12 13:45:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317449246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:56,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:56,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002938080] [2024-11-12 13:45:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:56,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:56,567 INFO L87 Difference]: Start difference. First operand 37382 states and 49156 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-12 13:45:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:56,679 INFO L93 Difference]: Finished difference Result 37897 states and 49158 transitions. [2024-11-12 13:45:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-12 13:45:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:56,736 INFO L225 Difference]: With dead ends: 37897 [2024-11-12 13:45:56,736 INFO L226 Difference]: Without dead ends: 37897 [2024-11-12 13:45:56,736 INFO L434 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-12 13:45:56,737 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:45:56,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37897 states. [2024-11-12 13:45:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37897 to 37894. [2024-11-12 13:45:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37894 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 0 states have call successors, (0), 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-12 13:45:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37894 states to 37894 states and 49156 transitions. [2024-11-12 13:45:57,364 INFO L78 Accepts]: Start accepts. Automaton has 37894 states and 49156 transitions. Word has length 31 [2024-11-12 13:45:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:57,365 INFO L471 AbstractCegarLoop]: Abstraction has 37894 states and 49156 transitions. [2024-11-12 13:45:57,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-12 13:45:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 37894 states and 49156 transitions. [2024-11-12 13:45:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:45:57,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:57,387 INFO L218 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, 1] [2024-11-12 13:45:57,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 13:45:57,388 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:57,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash 509990092, now seen corresponding path program 1 times [2024-11-12 13:45:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139007691] [2024-11-12 13:45:57,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:57,407 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-12 13:45:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139007691] [2024-11-12 13:45:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139007691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549133951] [2024-11-12 13:45:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:57,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:57,410 INFO L87 Difference]: Start difference. First operand 37894 states and 49156 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-12 13:45:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:57,733 INFO L93 Difference]: Finished difference Result 73737 states and 92166 transitions. [2024-11-12 13:45:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:57,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-12 13:45:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:57,830 INFO L225 Difference]: With dead ends: 73737 [2024-11-12 13:45:57,830 INFO L226 Difference]: Without dead ends: 73737 [2024-11-12 13:45:57,831 INFO L434 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-12 13:45:57,831 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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-12 13:45:57,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73737 states. [2024-11-12 13:45:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73737 to 73734. [2024-11-12 13:45:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73734 states, 73733 states have (on average 1.2499694844913403) internal successors, (92164), 73733 states have internal predecessors, (92164), 0 states have call successors, (0), 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-12 13:45:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73734 states to 73734 states and 92164 transitions. [2024-11-12 13:45:58,820 INFO L78 Accepts]: Start accepts. Automaton has 73734 states and 92164 transitions. Word has length 31 [2024-11-12 13:45:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:45:58,820 INFO L471 AbstractCegarLoop]: Abstraction has 73734 states and 92164 transitions. [2024-11-12 13:45:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-12 13:45:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 73734 states and 92164 transitions. [2024-11-12 13:45:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:45:58,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:45:58,866 INFO L218 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, 1] [2024-11-12 13:45:58,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 13:45:58,867 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:45:58,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:45:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2098337994, now seen corresponding path program 1 times [2024-11-12 13:45:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:45:58,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474437788] [2024-11-12 13:45:58,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:45:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:45:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:45:58,893 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-12 13:45:58,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:45:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474437788] [2024-11-12 13:45:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474437788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:45:58,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:45:58,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:45:58,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545109426] [2024-11-12 13:45:58,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:45:58,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:45:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:45:58,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:45:58,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:45:58,895 INFO L87 Difference]: Start difference. First operand 73734 states and 92164 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-12 13:45:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:45:59,392 INFO L93 Difference]: Finished difference Result 79881 states and 101382 transitions. [2024-11-12 13:45:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:45:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-12 13:45:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:45:59,505 INFO L225 Difference]: With dead ends: 79881 [2024-11-12 13:45:59,505 INFO L226 Difference]: Without dead ends: 79881 [2024-11-12 13:45:59,506 INFO L434 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-12 13:45:59,506 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 34 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:45:59,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:45:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79881 states. [2024-11-12 13:46:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79881 to 73734. [2024-11-12 13:46:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73734 states, 73733 states have (on average 1.2360815374391385) internal successors, (91140), 73733 states have internal predecessors, (91140), 0 states have call successors, (0), 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-12 13:46:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73734 states to 73734 states and 91140 transitions. [2024-11-12 13:46:00,465 INFO L78 Accepts]: Start accepts. Automaton has 73734 states and 91140 transitions. Word has length 31 [2024-11-12 13:46:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:00,465 INFO L471 AbstractCegarLoop]: Abstraction has 73734 states and 91140 transitions. [2024-11-12 13:46:00,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-12 13:46:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 73734 states and 91140 transitions. [2024-11-12 13:46:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:46:00,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:00,503 INFO L218 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, 1, 1] [2024-11-12 13:46:00,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 13:46:00,503 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:00,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1363494286, now seen corresponding path program 1 times [2024-11-12 13:46:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035696017] [2024-11-12 13:46:00,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:00,527 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-12 13:46:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035696017] [2024-11-12 13:46:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035696017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630827562] [2024-11-12 13:46:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:00,529 INFO L87 Difference]: Start difference. First operand 73734 states and 91140 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-12 13:46:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:00,868 INFO L93 Difference]: Finished difference Result 121865 states and 149510 transitions. [2024-11-12 13:46:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-12 13:46:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:01,012 INFO L225 Difference]: With dead ends: 121865 [2024-11-12 13:46:01,012 INFO L226 Difference]: Without dead ends: 121865 [2024-11-12 13:46:01,013 INFO L434 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-12 13:46:01,013 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 144 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-12 13:46:01,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121865 states. [2024-11-12 13:46:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121865 to 113670. [2024-11-12 13:46:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113670 states, 113669 states have (on average 1.2071892952344088) internal successors, (137220), 113669 states have internal predecessors, (137220), 0 states have call successors, (0), 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-12 13:46:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113670 states to 113670 states and 137220 transitions. [2024-11-12 13:46:02,765 INFO L78 Accepts]: Start accepts. Automaton has 113670 states and 137220 transitions. Word has length 32 [2024-11-12 13:46:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:02,765 INFO L471 AbstractCegarLoop]: Abstraction has 113670 states and 137220 transitions. [2024-11-12 13:46:02,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-12 13:46:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 113670 states and 137220 transitions. [2024-11-12 13:46:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:46:02,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:02,823 INFO L218 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, 1, 1] [2024-11-12 13:46:02,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 13:46:02,824 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:02,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1343125108, now seen corresponding path program 1 times [2024-11-12 13:46:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89190138] [2024-11-12 13:46:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:02,847 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-12 13:46:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89190138] [2024-11-12 13:46:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89190138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974997526] [2024-11-12 13:46:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:02,850 INFO L87 Difference]: Start difference. First operand 113670 states and 137220 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-12 13:46:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:03,109 INFO L93 Difference]: Finished difference Result 144393 states and 169990 transitions. [2024-11-12 13:46:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-12 13:46:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:03,892 INFO L225 Difference]: With dead ends: 144393 [2024-11-12 13:46:03,893 INFO L226 Difference]: Without dead ends: 144393 [2024-11-12 13:46:03,893 INFO L434 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-12 13:46:03,894 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 53 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 198 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-12 13:46:03,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 198 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144393 states. [2024-11-12 13:46:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144393 to 144390. [2024-11-12 13:46:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144390 states, 144389 states have (on average 1.1772918989673729) internal successors, (169988), 144389 states have internal predecessors, (169988), 0 states have call successors, (0), 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-12 13:46:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144390 states to 144390 states and 169988 transitions. [2024-11-12 13:46:06,189 INFO L78 Accepts]: Start accepts. Automaton has 144390 states and 169988 transitions. Word has length 32 [2024-11-12 13:46:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:06,189 INFO L471 AbstractCegarLoop]: Abstraction has 144390 states and 169988 transitions. [2024-11-12 13:46:06,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-12 13:46:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 144390 states and 169988 transitions. [2024-11-12 13:46:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:46:06,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:06,267 INFO L218 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, 1, 1, 1] [2024-11-12 13:46:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 13:46:06,267 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 688042711, now seen corresponding path program 1 times [2024-11-12 13:46:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687902738] [2024-11-12 13:46:06,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:06,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-12 13:46:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687902738] [2024-11-12 13:46:06,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687902738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:06,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:06,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580167957] [2024-11-12 13:46:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:06,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:06,293 INFO L87 Difference]: Start difference. First operand 144390 states and 169988 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12 13:46:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:06,600 INFO L93 Difference]: Finished difference Result 147465 states and 172038 transitions. [2024-11-12 13:46:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-12 13:46:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:06,743 INFO L225 Difference]: With dead ends: 147465 [2024-11-12 13:46:06,743 INFO L226 Difference]: Without dead ends: 147465 [2024-11-12 13:46:06,743 INFO L434 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-12 13:46:06,744 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:06,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147465 states. [2024-11-12 13:46:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147465 to 147462. [2024-11-12 13:46:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147462 states, 147461 states have (on average 1.1666542340008546) internal successors, (172036), 147461 states have internal predecessors, (172036), 0 states have call successors, (0), 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-12 13:46:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147462 states to 147462 states and 172036 transitions. [2024-11-12 13:46:08,687 INFO L78 Accepts]: Start accepts. Automaton has 147462 states and 172036 transitions. Word has length 33 [2024-11-12 13:46:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:08,687 INFO L471 AbstractCegarLoop]: Abstraction has 147462 states and 172036 transitions. [2024-11-12 13:46:08,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12 13:46:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 147462 states and 172036 transitions. [2024-11-12 13:46:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:46:08,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:08,745 INFO L218 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, 1, 1, 1] [2024-11-12 13:46:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 13:46:08,746 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1306101995, now seen corresponding path program 1 times [2024-11-12 13:46:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168146222] [2024-11-12 13:46:08,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:08,771 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-12 13:46:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168146222] [2024-11-12 13:46:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168146222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:08,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:08,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:08,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658216091] [2024-11-12 13:46:08,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:08,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:08,772 INFO L87 Difference]: Start difference. First operand 147462 states and 172036 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12 13:46:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:09,922 INFO L93 Difference]: Finished difference Result 237574 states and 270340 transitions. [2024-11-12 13:46:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:09,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-12 13:46:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:10,261 INFO L225 Difference]: With dead ends: 237574 [2024-11-12 13:46:10,261 INFO L226 Difference]: Without dead ends: 237574 [2024-11-12 13:46:10,262 INFO L434 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-12 13:46:10,262 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:46:10,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237574 states. [2024-11-12 13:46:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237574 to 229382. [2024-11-12 13:46:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229382 states, 229381 states have (on average 1.1428496693274508) internal successors, (262148), 229381 states have internal predecessors, (262148), 0 states have call successors, (0), 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-12 13:46:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229382 states to 229382 states and 262148 transitions. [2024-11-12 13:46:12,962 INFO L78 Accepts]: Start accepts. Automaton has 229382 states and 262148 transitions. Word has length 33 [2024-11-12 13:46:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:12,963 INFO L471 AbstractCegarLoop]: Abstraction has 229382 states and 262148 transitions. [2024-11-12 13:46:12,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12 13:46:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 229382 states and 262148 transitions. [2024-11-12 13:46:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:46:13,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:46:13,886 INFO L218 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, 1, 1, 1] [2024-11-12 13:46:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-12 13:46:13,887 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:46:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:46:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1400517399, now seen corresponding path program 1 times [2024-11-12 13:46:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:46:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172672911] [2024-11-12 13:46:13,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:46:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:46:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:46:13,940 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-12 13:46:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:46:13,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172672911] [2024-11-12 13:46:13,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172672911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:46:13,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:46:13,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:46:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386076781] [2024-11-12 13:46:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:46:13,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:46:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:46:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:46:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:46:13,942 INFO L87 Difference]: Start difference. First operand 229382 states and 262148 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12 13:46:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:46:14,798 INFO L93 Difference]: Finished difference Result 286723 states and 315394 transitions. [2024-11-12 13:46:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:46:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-12 13:46:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:46:14,799 INFO L225 Difference]: With dead ends: 286723 [2024-11-12 13:46:14,799 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:46:14,799 INFO L434 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-12 13:46:14,799 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 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-12 13:46:14,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:46:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:46:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:46:14,800 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-12 13:46:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:46:14,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2024-11-12 13:46:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:46:14,800 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:46:14,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12 13:46:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:46:14,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:46:14,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-12 13:46:14,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-12 13:46:14,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-12 13:46:14,806 INFO L421 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, 1, 1, 1, 1] [2024-11-12 13:46:14,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:46:14,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:46:14 BoogieIcfgContainer [2024-11-12 13:46:14,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:46:14,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:46:14,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:46:14,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:46:14,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:45:49" (3/4) ... [2024-11-12 13:46:14,812 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:46:14,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-12 13:46:14,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 13:46:14,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 13:46:14,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:46:14,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:46:14,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:46:14,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:46:14,914 INFO L158 Benchmark]: Toolchain (without parser) took 26006.62ms. Allocated memory was 165.7MB in the beginning and 13.9GB in the end (delta: 13.8GB). Free memory was 112.1MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-12 13:46:14,915 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory was 129.1MB in the beginning and 129.0MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:46:14,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.78ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 97.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 13:46:14,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.36ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:46:14,915 INFO L158 Benchmark]: Boogie Preprocessor took 36.61ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:46:14,915 INFO L158 Benchmark]: RCFGBuilder took 443.82ms. Allocated memory is still 165.7MB. Free memory was 93.2MB in the beginning and 75.6MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 13:46:14,915 INFO L158 Benchmark]: TraceAbstraction took 25099.91ms. Allocated memory was 165.7MB in the beginning and 13.9GB in the end (delta: 13.8GB). Free memory was 75.0MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-12 13:46:14,916 INFO L158 Benchmark]: Witness Printer took 103.73ms. Allocated memory is still 13.9GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 13:46:14,917 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.19ms. Allocated memory is still 165.7MB. Free memory was 129.1MB in the beginning and 129.0MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.78ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 97.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.36ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.61ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.82ms. Allocated memory is still 165.7MB. Free memory was 93.2MB in the beginning and 75.6MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25099.91ms. Allocated memory was 165.7MB in the beginning and 13.9GB in the end (delta: 13.8GB). Free memory was 75.0MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 103.73ms. Allocated memory is still 13.9GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.4s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2037 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2037 mSDsluCounter, 6626 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2599 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 4027 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229382occurred in iteration=37, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 38 MinimizatonAttempts, 32840 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 2049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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-12 13:46:14,951 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