./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:46:48,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:46:48,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:46:48,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:46:48,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:46:48,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:46:48,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:46:48,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:46:48,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:46:48,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:46:48,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:46:48,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:46:48,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:46:48,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:46:48,452 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:46:48,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:46:48,453 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:46:48,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:48,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:48,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:48,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:46:48,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:46:48,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:46:48,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:46:48,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:46:48,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:46:48,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:46:48,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2025-01-09 22:46:48,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:46:48,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:46:48,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:46:48,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:46:48,707 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:46:48,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2025-01-09 22:46:49,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b096ab8e/c983a0ba76314821b69ec99381dfdae2/FLAG4a53a56e2 [2025-01-09 22:46:50,096 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:46:50,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2025-01-09 22:46:50,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b096ab8e/c983a0ba76314821b69ec99381dfdae2/FLAG4a53a56e2 [2025-01-09 22:46:50,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b096ab8e/c983a0ba76314821b69ec99381dfdae2 [2025-01-09 22:46:50,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:46:50,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:46:50,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:50,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:46:50,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:46:50,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fc6326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50, skipping insertion in model container [2025-01-09 22:46:50,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:46:50,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:50,304 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:46:50,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:50,336 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:46:50,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50 WrapperNode [2025-01-09 22:46:50,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:50,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:50,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:46:50,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:46:50,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,366 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 170 [2025-01-09 22:46:50,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:50,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:46:50,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:46:50,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:46:50,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,392 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]. [2025-01-09 22:46:50,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:46:50,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:46:50,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:46:50,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:46:50,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (1/1) ... [2025-01-09 22:46:50,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:50,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:46:50,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:46:50,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:46:50,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:46:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:46:50,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:46:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:46:50,522 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:46:50,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:46:50,741 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 22:46:50,741 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:46:50,751 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:46:50,751 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:46:50,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:50 BoogieIcfgContainer [2025-01-09 22:46:50,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:46:50,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:46:50,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:46:50,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:46:50,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:46:50" (1/3) ... [2025-01-09 22:46:50,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbd82d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:50, skipping insertion in model container [2025-01-09 22:46:50,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:50" (2/3) ... [2025-01-09 22:46:50,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbd82d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:50, skipping insertion in model container [2025-01-09 22:46:50,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:50" (3/3) ... [2025-01-09 22:46:50,758 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2025-01-09 22:46:50,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:46:50,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_12.c that has 1 procedures, 49 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 22:46:50,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:46:50,802 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;@331d8c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:46:50,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 22:46:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:46:50,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:50,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:46:50,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash 28904286, now seen corresponding path program 1 times [2025-01-09 22:46:50,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:50,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620141470] [2025-01-09 22:46:50,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:50,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:46:50,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:46:50,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:50,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620141470] [2025-01-09 22:46:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620141470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:50,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:46:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415822749] [2025-01-09 22:46:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:50,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:46:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:50,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:46:50,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:46:50,955 INFO L87 Difference]: Start difference. First operand has 49 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 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) [2025-01-09 22:46:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:50,965 INFO L93 Difference]: Finished difference Result 48 states and 83 transitions. [2025-01-09 22:46:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:46:50,966 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 [2025-01-09 22:46:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:50,971 INFO L225 Difference]: With dead ends: 48 [2025-01-09 22:46:50,971 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 22:46:50,972 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 [2025-01-09 22:46:50,974 INFO L435 NwaCegarLoop]: 83 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, 83 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 [2025-01-09 22:46:50,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 22:46:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 22:46:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2025-01-09 22:46:51,001 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 5 [2025-01-09 22:46:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,002 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2025-01-09 22:46:51,002 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) [2025-01-09 22:46:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2025-01-09 22:46:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:46:51,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:46:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:46:51,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 889545134, now seen corresponding path program 1 times [2025-01-09 22:46:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063002208] [2025-01-09 22:46:51,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:46:51,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:46:51,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063002208] [2025-01-09 22:46:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063002208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:46:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099482998] [2025-01-09 22:46:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,061 INFO L87 Difference]: Start difference. First operand 46 states and 81 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) [2025-01-09 22:46:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,067 INFO L93 Difference]: Finished difference Result 45 states and 80 transitions. [2025-01-09 22:46:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,068 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 [2025-01-09 22:46:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,068 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:46:51,069 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:46:51,069 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 [2025-01-09 22:46:51,069 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 80 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 [2025-01-09 22:46:51,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:46:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 22:46:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2025-01-09 22:46:51,073 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 6 [2025-01-09 22:46:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,073 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2025-01-09 22:46:51,073 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) [2025-01-09 22:46:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2025-01-09 22:46:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:46:51,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,074 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] [2025-01-09 22:46:51,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:46:51,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash 51779468, now seen corresponding path program 1 times [2025-01-09 22:46:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48406057] [2025-01-09 22:46:51,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:46:51,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:46:51,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48406057] [2025-01-09 22:46:51,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48406057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149069713] [2025-01-09 22:46:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,125 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,144 INFO L93 Difference]: Finished difference Result 83 states and 150 transitions. [2025-01-09 22:46:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:46:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,145 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:46:51,145 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:46: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 [2025-01-09 22:46:51,146 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 154 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 [2025-01-09 22:46:51,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:46:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-01-09 22:46:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 79 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 148 transitions. [2025-01-09 22:46:51,152 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 148 transitions. Word has length 20 [2025-01-09 22:46:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,152 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 148 transitions. [2025-01-09 22:46:51,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 148 transitions. [2025-01-09 22:46:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:46:51,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,153 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] [2025-01-09 22:46:51,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:46:51,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1072847822, now seen corresponding path program 1 times [2025-01-09 22:46:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721908039] [2025-01-09 22:46:51,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:46:51,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:46:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721908039] [2025-01-09 22:46:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721908039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551886830] [2025-01-09 22:46:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,216 INFO L87 Difference]: Start difference. First operand 80 states and 148 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,229 INFO L93 Difference]: Finished difference Result 107 states and 195 transitions. [2025-01-09 22:46:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:46:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,230 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:46:51,231 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:46:51,231 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 [2025-01-09 22:46:51,231 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 219 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 [2025-01-09 22:46:51,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 219 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:46:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2025-01-09 22:46:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 147 transitions. [2025-01-09 22:46:51,237 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 147 transitions. Word has length 20 [2025-01-09 22:46:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,237 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 147 transitions. [2025-01-09 22:46:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 147 transitions. [2025-01-09 22:46:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:46:51,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,238 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] [2025-01-09 22:46:51,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:46:51,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1611750393, now seen corresponding path program 1 times [2025-01-09 22:46:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664044064] [2025-01-09 22:46:51,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:46:51,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:46:51,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664044064] [2025-01-09 22:46:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664044064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492601832] [2025-01-09 22:46:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,274 INFO L87 Difference]: Start difference. First operand 80 states and 147 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) [2025-01-09 22:46:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,299 INFO L93 Difference]: Finished difference Result 154 states and 283 transitions. [2025-01-09 22:46:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,300 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 [2025-01-09 22:46:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,301 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:46:51,301 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:46:51,301 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 [2025-01-09 22:46:51,302 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 56 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 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 [2025-01-09 22:46:51,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:46:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 107. [2025-01-09 22:46:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.8584905660377358) internal successors, (197), 106 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 197 transitions. [2025-01-09 22:46:51,308 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 197 transitions. Word has length 21 [2025-01-09 22:46:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,308 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 197 transitions. [2025-01-09 22:46:51,308 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) [2025-01-09 22:46:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 197 transitions. [2025-01-09 22:46:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:46:51,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,309 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] [2025-01-09 22:46:51,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:46:51,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,309 INFO L85 PathProgramCache]: Analyzing trace with hash 590682039, now seen corresponding path program 1 times [2025-01-09 22:46:51,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312722721] [2025-01-09 22:46:51,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:46:51,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:46:51,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312722721] [2025-01-09 22:46:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312722721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102771736] [2025-01-09 22:46:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,339 INFO L87 Difference]: Start difference. First operand 107 states and 197 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) [2025-01-09 22:46:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,351 INFO L93 Difference]: Finished difference Result 156 states and 282 transitions. [2025-01-09 22:46:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,352 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 [2025-01-09 22:46:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,353 INFO L225 Difference]: With dead ends: 156 [2025-01-09 22:46:51,353 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 22:46:51,353 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 [2025-01-09 22:46:51,354 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 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 [2025-01-09 22:46:51,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 22:46:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-01-09 22:46:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.8421052631578947) internal successors, (280), 152 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 280 transitions. [2025-01-09 22:46:51,361 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 280 transitions. Word has length 21 [2025-01-09 22:46:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 280 transitions. [2025-01-09 22:46:51,361 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) [2025-01-09 22:46:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 280 transitions. [2025-01-09 22:46:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:46:51,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,362 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] [2025-01-09 22:46:51,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:46:51,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1568747913, now seen corresponding path program 1 times [2025-01-09 22:46:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881317767] [2025-01-09 22:46:51,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:46:51,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:46:51,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881317767] [2025-01-09 22:46:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881317767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397457686] [2025-01-09 22:46:51,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,407 INFO L87 Difference]: Start difference. First operand 153 states and 280 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) [2025-01-09 22:46:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,421 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2025-01-09 22:46:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,422 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 [2025-01-09 22:46:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,423 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:46:51,423 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:46:51,423 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 [2025-01-09 22:46:51,424 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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 [2025-01-09 22:46:51,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:46:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-01-09 22:46:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.8089171974522293) internal successors, (284), 157 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 284 transitions. [2025-01-09 22:46:51,430 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 284 transitions. Word has length 22 [2025-01-09 22:46:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,430 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 284 transitions. [2025-01-09 22:46:51,430 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) [2025-01-09 22:46:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 284 transitions. [2025-01-09 22:46:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:46:51,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,431 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] [2025-01-09 22:46:51,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:46:51,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1137871481, now seen corresponding path program 1 times [2025-01-09 22:46:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018417598] [2025-01-09 22:46:51,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:46:51,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:46:51,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018417598] [2025-01-09 22:46:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018417598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821207566] [2025-01-09 22:46:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,481 INFO L87 Difference]: Start difference. First operand 158 states and 284 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) [2025-01-09 22:46:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,499 INFO L93 Difference]: Finished difference Result 297 states and 536 transitions. [2025-01-09 22:46:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,499 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 [2025-01-09 22:46:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,500 INFO L225 Difference]: With dead ends: 297 [2025-01-09 22:46:51,500 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 22:46:51,501 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 [2025-01-09 22:46:51,501 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 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 [2025-01-09 22:46:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 22:46:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 214. [2025-01-09 22:46:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 213 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 382 transitions. [2025-01-09 22:46:51,509 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 382 transitions. Word has length 22 [2025-01-09 22:46:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,509 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 382 transitions. [2025-01-09 22:46:51,509 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) [2025-01-09 22:46:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 382 transitions. [2025-01-09 22:46:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:46:51,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,510 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] [2025-01-09 22:46:51,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:46:51,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash 116803127, now seen corresponding path program 1 times [2025-01-09 22:46:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414011544] [2025-01-09 22:46:51,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:46:51,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:46:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414011544] [2025-01-09 22:46:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414011544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644801907] [2025-01-09 22:46:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,543 INFO L87 Difference]: Start difference. First operand 214 states and 382 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) [2025-01-09 22:46:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,562 INFO L93 Difference]: Finished difference Result 305 states and 538 transitions. [2025-01-09 22:46:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,563 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 [2025-01-09 22:46:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,564 INFO L225 Difference]: With dead ends: 305 [2025-01-09 22:46:51,564 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 22:46:51,564 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 [2025-01-09 22:46:51,565 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 175 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 [2025-01-09 22:46:51,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 22:46:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2025-01-09 22:46:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.7807308970099667) internal successors, (536), 301 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 536 transitions. [2025-01-09 22:46:51,575 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 536 transitions. Word has length 22 [2025-01-09 22:46:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,576 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 536 transitions. [2025-01-09 22:46:51,576 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) [2025-01-09 22:46:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 536 transitions. [2025-01-09 22:46:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:46:51,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,577 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] [2025-01-09 22:46:51,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:46:51,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash 920885570, now seen corresponding path program 1 times [2025-01-09 22:46:51,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450915546] [2025-01-09 22:46:51,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:46:51,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:46:51,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450915546] [2025-01-09 22:46:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450915546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287412228] [2025-01-09 22:46:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,611 INFO L87 Difference]: Start difference. First operand 302 states and 536 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) [2025-01-09 22:46:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,623 INFO L93 Difference]: Finished difference Result 309 states and 538 transitions. [2025-01-09 22:46:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,624 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 [2025-01-09 22:46:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,625 INFO L225 Difference]: With dead ends: 309 [2025-01-09 22:46:51,625 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 22:46:51,625 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 [2025-01-09 22:46:51,628 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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 [2025-01-09 22:46:51,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 22:46:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2025-01-09 22:46:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 536 transitions. [2025-01-09 22:46:51,638 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 536 transitions. Word has length 23 [2025-01-09 22:46:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,639 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 536 transitions. [2025-01-09 22:46:51,639 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) [2025-01-09 22:46:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 536 transitions. [2025-01-09 22:46:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:46:51,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,640 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] [2025-01-09 22:46:51,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:46:51,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -667462332, now seen corresponding path program 1 times [2025-01-09 22:46:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519515289] [2025-01-09 22:46:51,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:46:51,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:46:51,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519515289] [2025-01-09 22:46:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519515289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772230832] [2025-01-09 22:46:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,663 INFO L87 Difference]: Start difference. First operand 306 states and 536 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) [2025-01-09 22:46:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,681 INFO L93 Difference]: Finished difference Result 569 states and 1002 transitions. [2025-01-09 22:46:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,682 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 [2025-01-09 22:46:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,683 INFO L225 Difference]: With dead ends: 569 [2025-01-09 22:46:51,683 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 22:46:51,684 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 [2025-01-09 22:46:51,684 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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 [2025-01-09 22:46:51,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 22:46:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 422. [2025-01-09 22:46:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 728 transitions. [2025-01-09 22:46:51,701 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 728 transitions. Word has length 23 [2025-01-09 22:46:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,701 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 728 transitions. [2025-01-09 22:46:51,701 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) [2025-01-09 22:46:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 728 transitions. [2025-01-09 22:46:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:46:51,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,705 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] [2025-01-09 22:46:51,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:46:51,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1688530686, now seen corresponding path program 1 times [2025-01-09 22:46:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869740834] [2025-01-09 22:46:51,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:46:51,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:46:51,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869740834] [2025-01-09 22:46:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869740834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397985123] [2025-01-09 22:46:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,741 INFO L87 Difference]: Start difference. First operand 422 states and 728 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) [2025-01-09 22:46:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,756 INFO L93 Difference]: Finished difference Result 593 states and 1014 transitions. [2025-01-09 22:46:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,756 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 [2025-01-09 22:46:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,758 INFO L225 Difference]: With dead ends: 593 [2025-01-09 22:46:51,758 INFO L226 Difference]: Without dead ends: 593 [2025-01-09 22:46:51,758 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 [2025-01-09 22:46:51,759 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 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 [2025-01-09 22:46:51,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-09 22:46:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2025-01-09 22:46:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1012 transitions. [2025-01-09 22:46:51,788 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1012 transitions. Word has length 23 [2025-01-09 22:46:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 1012 transitions. [2025-01-09 22:46:51,789 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) [2025-01-09 22:46:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1012 transitions. [2025-01-09 22:46:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:46:51,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,790 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] [2025-01-09 22:46:51,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:46:51,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 790122786, now seen corresponding path program 1 times [2025-01-09 22:46:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422066396] [2025-01-09 22:46:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:46:51,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:46:51,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422066396] [2025-01-09 22:46:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422066396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921081212] [2025-01-09 22:46:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,821 INFO L87 Difference]: Start difference. First operand 590 states and 1012 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) [2025-01-09 22:46:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,832 INFO L93 Difference]: Finished difference Result 601 states and 1014 transitions. [2025-01-09 22:46:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,832 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 [2025-01-09 22:46:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,834 INFO L225 Difference]: With dead ends: 601 [2025-01-09 22:46:51,834 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 22:46:51,835 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 [2025-01-09 22:46:51,836 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 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 [2025-01-09 22:46:51,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 22:46:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2025-01-09 22:46:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1012 transitions. [2025-01-09 22:46:51,849 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1012 transitions. Word has length 24 [2025-01-09 22:46:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,849 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 1012 transitions. [2025-01-09 22:46:51,849 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) [2025-01-09 22:46:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1012 transitions. [2025-01-09 22:46:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:46:51,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,852 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] [2025-01-09 22:46:51,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:46:51,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash -798225116, now seen corresponding path program 1 times [2025-01-09 22:46:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260527593] [2025-01-09 22:46:51,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:46:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:46:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260527593] [2025-01-09 22:46:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260527593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416126148] [2025-01-09 22:46:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,884 INFO L87 Difference]: Start difference. First operand 598 states and 1012 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) [2025-01-09 22:46:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,898 INFO L93 Difference]: Finished difference Result 1097 states and 1870 transitions. [2025-01-09 22:46:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,899 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 [2025-01-09 22:46:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,902 INFO L225 Difference]: With dead ends: 1097 [2025-01-09 22:46:51,902 INFO L226 Difference]: Without dead ends: 1097 [2025-01-09 22:46:51,902 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 [2025-01-09 22:46:51,903 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 146 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 [2025-01-09 22:46:51,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-01-09 22:46:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 838. [2025-01-09 22:46:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1388 transitions. [2025-01-09 22:46:51,921 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1388 transitions. Word has length 24 [2025-01-09 22:46:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1388 transitions. [2025-01-09 22:46:51,922 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) [2025-01-09 22:46:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1388 transitions. [2025-01-09 22:46:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:46:51,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,923 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] [2025-01-09 22:46:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:46:51,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1819293470, now seen corresponding path program 1 times [2025-01-09 22:46:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848274010] [2025-01-09 22:46:51,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:46:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:46:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:51,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:51,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848274010] [2025-01-09 22:46:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848274010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426429087] [2025-01-09 22:46:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:51,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:51,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:51,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:51,951 INFO L87 Difference]: Start difference. First operand 838 states and 1388 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) [2025-01-09 22:46:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:51,964 INFO L93 Difference]: Finished difference Result 1161 states and 1910 transitions. [2025-01-09 22:46:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:51,964 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 [2025-01-09 22:46:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:51,968 INFO L225 Difference]: With dead ends: 1161 [2025-01-09 22:46:51,968 INFO L226 Difference]: Without dead ends: 1161 [2025-01-09 22:46:51,969 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 [2025-01-09 22:46:51,971 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 177 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 [2025-01-09 22:46:51,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-01-09 22:46:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1158. [2025-01-09 22:46:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1908 transitions. [2025-01-09 22:46:51,988 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1908 transitions. Word has length 24 [2025-01-09 22:46:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:51,989 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1908 transitions. [2025-01-09 22:46:51,990 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) [2025-01-09 22:46:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1908 transitions. [2025-01-09 22:46:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:46:51,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:51,991 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] [2025-01-09 22:46:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:46:51,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1031454349, now seen corresponding path program 1 times [2025-01-09 22:46:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56828988] [2025-01-09 22:46:51,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:51,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:46:52,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:46:52,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56828988] [2025-01-09 22:46:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56828988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150230614] [2025-01-09 22:46:52,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,017 INFO L87 Difference]: Start difference. First operand 1158 states and 1908 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) [2025-01-09 22:46:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,031 INFO L93 Difference]: Finished difference Result 1177 states and 1910 transitions. [2025-01-09 22:46:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,031 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 [2025-01-09 22:46:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,034 INFO L225 Difference]: With dead ends: 1177 [2025-01-09 22:46:52,035 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 22:46:52,035 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 [2025-01-09 22:46:52,035 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 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 [2025-01-09 22:46:52,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 22:46:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1174. [2025-01-09 22:46:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1908 transitions. [2025-01-09 22:46:52,055 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1908 transitions. Word has length 25 [2025-01-09 22:46:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,056 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1908 transitions. [2025-01-09 22:46:52,056 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) [2025-01-09 22:46:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1908 transitions. [2025-01-09 22:46:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:46:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,058 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] [2025-01-09 22:46:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:46:52,058 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash -556893553, now seen corresponding path program 1 times [2025-01-09 22:46:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251294158] [2025-01-09 22:46:52,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:46:52,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:46:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251294158] [2025-01-09 22:46:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251294158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765306494] [2025-01-09 22:46:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,099 INFO L87 Difference]: Start difference. First operand 1174 states and 1908 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) [2025-01-09 22:46:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,117 INFO L93 Difference]: Finished difference Result 2121 states and 3478 transitions. [2025-01-09 22:46:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,118 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 [2025-01-09 22:46:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,127 INFO L225 Difference]: With dead ends: 2121 [2025-01-09 22:46:52,127 INFO L226 Difference]: Without dead ends: 2121 [2025-01-09 22:46:52,128 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 [2025-01-09 22:46:52,129 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 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 [2025-01-09 22:46:52,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2025-01-09 22:46:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1670. [2025-01-09 22:46:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2644 transitions. [2025-01-09 22:46:52,157 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2644 transitions. Word has length 25 [2025-01-09 22:46:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,157 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2644 transitions. [2025-01-09 22:46:52,157 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) [2025-01-09 22:46:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2644 transitions. [2025-01-09 22:46:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:46:52,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,159 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] [2025-01-09 22:46:52,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:46:52,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1577961907, now seen corresponding path program 1 times [2025-01-09 22:46:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285775946] [2025-01-09 22:46:52,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:46:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:46:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285775946] [2025-01-09 22:46:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285775946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672362460] [2025-01-09 22:46:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,191 INFO L87 Difference]: Start difference. First operand 1670 states and 2644 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) [2025-01-09 22:46:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,210 INFO L93 Difference]: Finished difference Result 2281 states and 3590 transitions. [2025-01-09 22:46:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,211 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 [2025-01-09 22:46:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,216 INFO L225 Difference]: With dead ends: 2281 [2025-01-09 22:46:52,217 INFO L226 Difference]: Without dead ends: 2281 [2025-01-09 22:46:52,217 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 [2025-01-09 22:46:52,218 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 178 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 [2025-01-09 22:46:52,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2025-01-09 22:46:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2278. [2025-01-09 22:46:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 3588 transitions. [2025-01-09 22:46:52,252 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 3588 transitions. Word has length 25 [2025-01-09 22:46:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,252 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 3588 transitions. [2025-01-09 22:46:52,252 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) [2025-01-09 22:46:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 3588 transitions. [2025-01-09 22:46:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:46:52,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,255 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] [2025-01-09 22:46:52,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:46:52,255 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash -77191219, now seen corresponding path program 1 times [2025-01-09 22:46:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163077908] [2025-01-09 22:46:52,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:46:52,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:46:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163077908] [2025-01-09 22:46:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163077908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841328886] [2025-01-09 22:46:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,284 INFO L87 Difference]: Start difference. First operand 2278 states and 3588 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) [2025-01-09 22:46:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,300 INFO L93 Difference]: Finished difference Result 2313 states and 3590 transitions. [2025-01-09 22:46:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,301 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 [2025-01-09 22:46:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,307 INFO L225 Difference]: With dead ends: 2313 [2025-01-09 22:46:52,307 INFO L226 Difference]: Without dead ends: 2313 [2025-01-09 22:46:52,307 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 [2025-01-09 22:46:52,308 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 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 [2025-01-09 22:46:52,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2025-01-09 22:46:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2310. [2025-01-09 22:46:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3588 transitions. [2025-01-09 22:46:52,379 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3588 transitions. Word has length 26 [2025-01-09 22:46:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,379 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 3588 transitions. [2025-01-09 22:46:52,379 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) [2025-01-09 22:46:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3588 transitions. [2025-01-09 22:46:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:46:52,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,382 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] [2025-01-09 22:46:52,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:46:52,382 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1665539121, now seen corresponding path program 1 times [2025-01-09 22:46:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021385620] [2025-01-09 22:46:52,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:46:52,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:46:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021385620] [2025-01-09 22:46:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021385620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472516923] [2025-01-09 22:46:52,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,402 INFO L87 Difference]: Start difference. First operand 2310 states and 3588 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) [2025-01-09 22:46:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,426 INFO L93 Difference]: Finished difference Result 4105 states and 6438 transitions. [2025-01-09 22:46:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,426 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 [2025-01-09 22:46:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,438 INFO L225 Difference]: With dead ends: 4105 [2025-01-09 22:46:52,438 INFO L226 Difference]: Without dead ends: 4105 [2025-01-09 22:46:52,438 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 [2025-01-09 22:46:52,439 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:52,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2025-01-09 22:46:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3334. [2025-01-09 22:46:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 5028 transitions. [2025-01-09 22:46:52,498 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 5028 transitions. Word has length 26 [2025-01-09 22:46:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,498 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 5028 transitions. [2025-01-09 22:46:52,498 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) [2025-01-09 22:46:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 5028 transitions. [2025-01-09 22:46:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:46:52,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,501 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] [2025-01-09 22:46:52,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:46:52,502 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1608359821, now seen corresponding path program 1 times [2025-01-09 22:46:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723820306] [2025-01-09 22:46:52,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:46:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:46:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723820306] [2025-01-09 22:46:52,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723820306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913441129] [2025-01-09 22:46:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,521 INFO L87 Difference]: Start difference. First operand 3334 states and 5028 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) [2025-01-09 22:46:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,549 INFO L93 Difference]: Finished difference Result 4489 states and 6726 transitions. [2025-01-09 22:46:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,549 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 [2025-01-09 22:46:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,559 INFO L225 Difference]: With dead ends: 4489 [2025-01-09 22:46:52,560 INFO L226 Difference]: Without dead ends: 4489 [2025-01-09 22:46:52,560 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 [2025-01-09 22:46:52,560 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 179 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 [2025-01-09 22:46:52,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2025-01-09 22:46:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4486. [2025-01-09 22:46:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4486 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 6724 transitions. [2025-01-09 22:46:52,669 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 6724 transitions. Word has length 26 [2025-01-09 22:46:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 4486 states and 6724 transitions. [2025-01-09 22:46:52,669 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) [2025-01-09 22:46:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 6724 transitions. [2025-01-09 22:46:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:46:52,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,672 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] [2025-01-09 22:46:52,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:46:52,672 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -85454888, now seen corresponding path program 1 times [2025-01-09 22:46:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605065016] [2025-01-09 22:46:52,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:46:52,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:46:52,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605065016] [2025-01-09 22:46:52,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605065016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330520088] [2025-01-09 22:46:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,697 INFO L87 Difference]: Start difference. First operand 4486 states and 6724 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) [2025-01-09 22:46:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,721 INFO L93 Difference]: Finished difference Result 4553 states and 6726 transitions. [2025-01-09 22:46:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,722 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 [2025-01-09 22:46:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,741 INFO L225 Difference]: With dead ends: 4553 [2025-01-09 22:46:52,741 INFO L226 Difference]: Without dead ends: 4553 [2025-01-09 22:46:52,741 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 [2025-01-09 22:46:52,742 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 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 [2025-01-09 22:46:52,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2025-01-09 22:46:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4550. [2025-01-09 22:46:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6724 transitions. [2025-01-09 22:46:52,834 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6724 transitions. Word has length 27 [2025-01-09 22:46:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:52,835 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 6724 transitions. [2025-01-09 22:46:52,835 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) [2025-01-09 22:46:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6724 transitions. [2025-01-09 22:46:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:46:52,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:52,839 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] [2025-01-09 22:46:52,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:46:52,839 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:52,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1673802790, now seen corresponding path program 1 times [2025-01-09 22:46:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595439584] [2025-01-09 22:46:52,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:52,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:46:52,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:46:52,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:52,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595439584] [2025-01-09 22:46:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595439584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131313508] [2025-01-09 22:46:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:52,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:52,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:52,861 INFO L87 Difference]: Start difference. First operand 4550 states and 6724 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) [2025-01-09 22:46:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:52,896 INFO L93 Difference]: Finished difference Result 7945 states and 11846 transitions. [2025-01-09 22:46:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:52,897 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 [2025-01-09 22:46:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:52,910 INFO L225 Difference]: With dead ends: 7945 [2025-01-09 22:46:52,911 INFO L226 Difference]: Without dead ends: 7945 [2025-01-09 22:46:52,911 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 [2025-01-09 22:46:52,912 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 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 [2025-01-09 22:46:52,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2025-01-09 22:46:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 6662. [2025-01-09 22:46:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 9540 transitions. [2025-01-09 22:46:53,036 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 9540 transitions. Word has length 27 [2025-01-09 22:46:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:53,037 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 9540 transitions. [2025-01-09 22:46:53,037 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) [2025-01-09 22:46:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 9540 transitions. [2025-01-09 22:46:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:46:53,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:53,044 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] [2025-01-09 22:46:53,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:46:53,044 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:53,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1600096152, now seen corresponding path program 1 times [2025-01-09 22:46:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860811203] [2025-01-09 22:46:53,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:53,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:46:53,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:46:53,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:53,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860811203] [2025-01-09 22:46:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860811203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:53,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445265666] [2025-01-09 22:46:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:53,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:53,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:53,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:53,070 INFO L87 Difference]: Start difference. First operand 6662 states and 9540 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) [2025-01-09 22:46:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:53,107 INFO L93 Difference]: Finished difference Result 8841 states and 12550 transitions. [2025-01-09 22:46:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:53,107 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 [2025-01-09 22:46:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:53,120 INFO L225 Difference]: With dead ends: 8841 [2025-01-09 22:46:53,120 INFO L226 Difference]: Without dead ends: 8841 [2025-01-09 22:46:53,121 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 [2025-01-09 22:46:53,122 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 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 [2025-01-09 22:46:53,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2025-01-09 22:46:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 8838. [2025-01-09 22:46:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12548 transitions. [2025-01-09 22:46:53,260 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12548 transitions. Word has length 27 [2025-01-09 22:46:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:53,260 INFO L471 AbstractCegarLoop]: Abstraction has 8838 states and 12548 transitions. [2025-01-09 22:46:53,261 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) [2025-01-09 22:46:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12548 transitions. [2025-01-09 22:46:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:46:53,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:53,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] [2025-01-09 22:46:53,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:46:53,267 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:53,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -341618056, now seen corresponding path program 1 times [2025-01-09 22:46:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:53,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85190968] [2025-01-09 22:46:53,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:46:53,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:46:53,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:53,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85190968] [2025-01-09 22:46:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85190968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762048708] [2025-01-09 22:46:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:53,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:53,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:53,291 INFO L87 Difference]: Start difference. First operand 8838 states and 12548 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) [2025-01-09 22:46:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:53,328 INFO L93 Difference]: Finished difference Result 8969 states and 12550 transitions. [2025-01-09 22:46:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:53,329 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 [2025-01-09 22:46:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:53,340 INFO L225 Difference]: With dead ends: 8969 [2025-01-09 22:46:53,340 INFO L226 Difference]: Without dead ends: 8969 [2025-01-09 22:46:53,341 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 [2025-01-09 22:46:53,341 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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 [2025-01-09 22:46:53,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8969 states. [2025-01-09 22:46:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8969 to 8966. [2025-01-09 22:46:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8966 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 12548 transitions. [2025-01-09 22:46:53,445 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 12548 transitions. Word has length 28 [2025-01-09 22:46:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:53,445 INFO L471 AbstractCegarLoop]: Abstraction has 8966 states and 12548 transitions. [2025-01-09 22:46:53,445 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) [2025-01-09 22:46:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 12548 transitions. [2025-01-09 22:46:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:46:53,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:53,451 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] [2025-01-09 22:46:53,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:46:53,452 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1929965958, now seen corresponding path program 1 times [2025-01-09 22:46:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799720324] [2025-01-09 22:46:53,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:53,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:46:53,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:46:53,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:53,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799720324] [2025-01-09 22:46:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799720324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:53,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323778600] [2025-01-09 22:46:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:53,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:53,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:53,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:53,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:53,474 INFO L87 Difference]: Start difference. First operand 8966 states and 12548 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) [2025-01-09 22:46:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:53,561 INFO L93 Difference]: Finished difference Result 17417 states and 23558 transitions. [2025-01-09 22:46:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:53,561 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 [2025-01-09 22:46:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:53,586 INFO L225 Difference]: With dead ends: 17417 [2025-01-09 22:46:53,586 INFO L226 Difference]: Without dead ends: 17417 [2025-01-09 22:46:53,587 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 [2025-01-09 22:46:53,587 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 154 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 [2025-01-09 22:46:53,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17417 states. [2025-01-09 22:46:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17417 to 17414. [2025-01-09 22:46:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 17413 states have (on average 1.352782403951071) internal successors, (23556), 17413 states have internal predecessors, (23556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 23556 transitions. [2025-01-09 22:46:53,831 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 23556 transitions. Word has length 28 [2025-01-09 22:46:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:53,832 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 23556 transitions. [2025-01-09 22:46:53,832 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) [2025-01-09 22:46:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 23556 transitions. [2025-01-09 22:46:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:46:53,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:53,842 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] [2025-01-09 22:46:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:46:53,843 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash -908897604, now seen corresponding path program 1 times [2025-01-09 22:46:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474585013] [2025-01-09 22:46:53,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:46:53,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:46:53,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:53,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:53,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474585013] [2025-01-09 22:46:53,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474585013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:53,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405040531] [2025-01-09 22:46:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:53,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:53,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:53,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:53,867 INFO L87 Difference]: Start difference. First operand 17414 states and 23556 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) [2025-01-09 22:46:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:53,908 INFO L93 Difference]: Finished difference Result 19465 states and 26886 transitions. [2025-01-09 22:46:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:53,908 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 [2025-01-09 22:46:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:53,937 INFO L225 Difference]: With dead ends: 19465 [2025-01-09 22:46:53,937 INFO L226 Difference]: Without dead ends: 19465 [2025-01-09 22:46:53,937 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 [2025-01-09 22:46:53,938 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 35 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 179 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 [2025-01-09 22:46:53,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 179 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19465 states. [2025-01-09 22:46:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19465 to 17414. [2025-01-09 22:46:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 23300 transitions. [2025-01-09 22:46:54,178 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 23300 transitions. Word has length 28 [2025-01-09 22:46:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 23300 transitions. [2025-01-09 22:46:54,179 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) [2025-01-09 22:46:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 23300 transitions. [2025-01-09 22:46:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:46:54,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:54,193 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] [2025-01-09 22:46:54,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:46:54,193 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 307268899, now seen corresponding path program 1 times [2025-01-09 22:46:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:54,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401199061] [2025-01-09 22:46:54,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:46:54,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:46:54,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:54,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:54,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:54,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401199061] [2025-01-09 22:46:54,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401199061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:54,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:54,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861351330] [2025-01-09 22:46:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:54,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:54,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:54,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:54,223 INFO L87 Difference]: Start difference. First operand 17414 states and 23300 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) [2025-01-09 22:46:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:54,287 INFO L93 Difference]: Finished difference Result 29449 states and 39430 transitions. [2025-01-09 22:46:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:54,287 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 [2025-01-09 22:46:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:54,335 INFO L225 Difference]: With dead ends: 29449 [2025-01-09 22:46:54,335 INFO L226 Difference]: Without dead ends: 29449 [2025-01-09 22:46:54,335 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 [2025-01-09 22:46:54,336 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 32 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:54,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29449 states. [2025-01-09 22:46:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29449 to 26374. [2025-01-09 22:46:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26374 states, 26373 states have (on average 1.3008758958025253) internal successors, (34308), 26373 states have internal predecessors, (34308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26374 states to 26374 states and 34308 transitions. [2025-01-09 22:46:54,707 INFO L78 Accepts]: Start accepts. Automaton has 26374 states and 34308 transitions. Word has length 29 [2025-01-09 22:46:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 26374 states and 34308 transitions. [2025-01-09 22:46:54,707 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) [2025-01-09 22:46:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26374 states and 34308 transitions. [2025-01-09 22:46:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:46:54,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:54,731 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] [2025-01-09 22:46:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:46:54,731 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -713799455, now seen corresponding path program 1 times [2025-01-09 22:46:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068730413] [2025-01-09 22:46:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:54,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:46:54,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:46:54,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:54,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068730413] [2025-01-09 22:46:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068730413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275359531] [2025-01-09 22:46:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:54,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:54,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:54,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:54,752 INFO L87 Difference]: Start difference. First operand 26374 states and 34308 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) [2025-01-09 22:46:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:54,808 INFO L93 Difference]: Finished difference Result 34057 states and 43526 transitions. [2025-01-09 22:46:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:54,808 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 [2025-01-09 22:46:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:54,856 INFO L225 Difference]: With dead ends: 34057 [2025-01-09 22:46:54,856 INFO L226 Difference]: Without dead ends: 34057 [2025-01-09 22:46:54,857 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 [2025-01-09 22:46:54,857 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 182 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 [2025-01-09 22:46:54,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34057 states. [2025-01-09 22:46:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34057 to 34054. [2025-01-09 22:46:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34054 states, 34053 states have (on average 1.2781252753061405) internal successors, (43524), 34053 states have internal predecessors, (43524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34054 states to 34054 states and 43524 transitions. [2025-01-09 22:46:55,277 INFO L78 Accepts]: Start accepts. Automaton has 34054 states and 43524 transitions. Word has length 29 [2025-01-09 22:46:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 34054 states and 43524 transitions. [2025-01-09 22:46:55,278 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) [2025-01-09 22:46:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34054 states and 43524 transitions. [2025-01-09 22:46:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:46:55,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:55,291 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] [2025-01-09 22:46:55,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:46:55,291 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 942083301, now seen corresponding path program 1 times [2025-01-09 22:46:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:55,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461381312] [2025-01-09 22:46:55,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:55,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:46:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:46:55,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:55,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461381312] [2025-01-09 22:46:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461381312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559581271] [2025-01-09 22:46:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:55,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:55,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:55,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:55,310 INFO L87 Difference]: Start difference. First operand 34054 states and 43524 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) [2025-01-09 22:46:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:55,368 INFO L93 Difference]: Finished difference Result 34825 states and 44038 transitions. [2025-01-09 22:46:55,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:55,369 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 [2025-01-09 22:46:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:55,418 INFO L225 Difference]: With dead ends: 34825 [2025-01-09 22:46:55,418 INFO L226 Difference]: Without dead ends: 34825 [2025-01-09 22:46:55,419 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 [2025-01-09 22:46:55,419 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:55,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34825 states. [2025-01-09 22:46:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34825 to 34822. [2025-01-09 22:46:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34822 states, 34821 states have (on average 1.264639154533184) internal successors, (44036), 34821 states have internal predecessors, (44036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34822 states to 34822 states and 44036 transitions. [2025-01-09 22:46:55,944 INFO L78 Accepts]: Start accepts. Automaton has 34822 states and 44036 transitions. Word has length 30 [2025-01-09 22:46:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:55,944 INFO L471 AbstractCegarLoop]: Abstraction has 34822 states and 44036 transitions. [2025-01-09 22:46:55,944 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) [2025-01-09 22:46:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34822 states and 44036 transitions. [2025-01-09 22:46:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:46:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:55,958 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] [2025-01-09 22:46:55,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 22:46:55,958 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:55,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash -646264601, now seen corresponding path program 1 times [2025-01-09 22:46:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:55,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260309079] [2025-01-09 22:46:55,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:55,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:46:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:46:55,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:55,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260309079] [2025-01-09 22:46:55,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260309079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:55,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:55,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133749424] [2025-01-09 22:46:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:55,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:55,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:55,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:55,975 INFO L87 Difference]: Start difference. First operand 34822 states and 44036 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) [2025-01-09 22:46:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:56,065 INFO L93 Difference]: Finished difference Result 57353 states and 71686 transitions. [2025-01-09 22:46:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:56,066 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 [2025-01-09 22:46:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:56,141 INFO L225 Difference]: With dead ends: 57353 [2025-01-09 22:46:56,141 INFO L226 Difference]: Without dead ends: 57353 [2025-01-09 22:46:56,141 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 [2025-01-09 22:46:56,142 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:56,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57353 states. [2025-01-09 22:46:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57353 to 53254. [2025-01-09 22:46:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53254 states, 53253 states have (on average 1.2307287852327569) internal successors, (65540), 53253 states have internal predecessors, (65540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53254 states to 53254 states and 65540 transitions. [2025-01-09 22:46:56,902 INFO L78 Accepts]: Start accepts. Automaton has 53254 states and 65540 transitions. Word has length 30 [2025-01-09 22:46:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:56,903 INFO L471 AbstractCegarLoop]: Abstraction has 53254 states and 65540 transitions. [2025-01-09 22:46:56,903 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) [2025-01-09 22:46:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 53254 states and 65540 transitions. [2025-01-09 22:46:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:46:56,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:56,932 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] [2025-01-09 22:46:56,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:46:56,932 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:56,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1667332955, now seen corresponding path program 1 times [2025-01-09 22:46:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615444627] [2025-01-09 22:46:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:56,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:46:56,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:46:56,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:56,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:56,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:56,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615444627] [2025-01-09 22:46:56,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615444627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:56,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:56,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960977832] [2025-01-09 22:46:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:56,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:56,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:56,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:56,960 INFO L87 Difference]: Start difference. First operand 53254 states and 65540 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) [2025-01-09 22:46:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:57,065 INFO L93 Difference]: Finished difference Result 67593 states and 80902 transitions. [2025-01-09 22:46:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:57,066 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 [2025-01-09 22:46:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:57,128 INFO L225 Difference]: With dead ends: 67593 [2025-01-09 22:46:57,128 INFO L226 Difference]: Without dead ends: 67593 [2025-01-09 22:46:57,130 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 [2025-01-09 22:46:57,130 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 183 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 [2025-01-09 22:46:57,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 183 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67593 states. [2025-01-09 22:46:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67593 to 67590. [2025-01-09 22:46:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67590 states, 67589 states have (on average 1.1969403305271569) internal successors, (80900), 67589 states have internal predecessors, (80900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67590 states to 67590 states and 80900 transitions. [2025-01-09 22:46:58,010 INFO L78 Accepts]: Start accepts. Automaton has 67590 states and 80900 transitions. Word has length 30 [2025-01-09 22:46:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:58,010 INFO L471 AbstractCegarLoop]: Abstraction has 67590 states and 80900 transitions. [2025-01-09 22:46:58,010 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) [2025-01-09 22:46:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 67590 states and 80900 transitions. [2025-01-09 22:46:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:46:58,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:58,045 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] [2025-01-09 22:46:58,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:46:58,046 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:58,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:58,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1447326444, now seen corresponding path program 1 times [2025-01-09 22:46:58,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:58,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486955410] [2025-01-09 22:46:58,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:58,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:46:58,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:46:58,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:58,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486955410] [2025-01-09 22:46:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486955410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611270940] [2025-01-09 22:46:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:58,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:58,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:58,068 INFO L87 Difference]: Start difference. First operand 67590 states and 80900 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) [2025-01-09 22:46:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:58,346 INFO L93 Difference]: Finished difference Result 68617 states and 80902 transitions. [2025-01-09 22:46:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:58,346 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 [2025-01-09 22:46:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:58,416 INFO L225 Difference]: With dead ends: 68617 [2025-01-09 22:46:58,416 INFO L226 Difference]: Without dead ends: 68617 [2025-01-09 22:46:58,416 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 [2025-01-09 22:46:58,417 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:58,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68617 states. [2025-01-09 22:46:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68617 to 68614. [2025-01-09 22:46:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68614 states, 68613 states have (on average 1.1790768513255505) internal successors, (80900), 68613 states have internal predecessors, (80900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:46:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68614 states to 68614 states and 80900 transitions. [2025-01-09 22:46:59,216 INFO L78 Accepts]: Start accepts. Automaton has 68614 states and 80900 transitions. Word has length 31 [2025-01-09 22:46:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:59,216 INFO L471 AbstractCegarLoop]: Abstraction has 68614 states and 80900 transitions. [2025-01-09 22:46:59,216 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) [2025-01-09 22:46:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 68614 states and 80900 transitions. [2025-01-09 22:46:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:46:59,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:59,256 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] [2025-01-09 22:46:59,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:46:59,256 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:46:59,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash -141021458, now seen corresponding path program 1 times [2025-01-09 22:46:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:59,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504981775] [2025-01-09 22:46:59,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:59,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:46:59,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:46:59,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:59,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504981775] [2025-01-09 22:46:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504981775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995489949] [2025-01-09 22:46:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:46:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:59,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:46:59,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:46:59,275 INFO L87 Difference]: Start difference. First operand 68614 states and 80900 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) [2025-01-09 22:46:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:59,516 INFO L93 Difference]: Finished difference Result 110598 states and 126980 transitions. [2025-01-09 22:46:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:46:59,517 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 [2025-01-09 22:46:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:59,658 INFO L225 Difference]: With dead ends: 110598 [2025-01-09 22:46:59,658 INFO L226 Difference]: Without dead ends: 110598 [2025-01-09 22:46:59,658 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 [2025-01-09 22:46:59,659 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:59,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:46:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110598 states. [2025-01-09 22:47:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110598 to 106502. [2025-01-09 22:47:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106502 states, 106501 states have (on average 1.1538295415066526) internal successors, (122884), 106501 states have internal predecessors, (122884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106502 states to 106502 states and 122884 transitions. [2025-01-09 22:47:00,848 INFO L78 Accepts]: Start accepts. Automaton has 106502 states and 122884 transitions. Word has length 31 [2025-01-09 22:47:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,849 INFO L471 AbstractCegarLoop]: Abstraction has 106502 states and 122884 transitions. [2025-01-09 22:47:00,849 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) [2025-01-09 22:47:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 106502 states and 122884 transitions. [2025-01-09 22:47:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:47:01,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:01,121 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] [2025-01-09 22:47:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:47:01,121 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1162089812, now seen corresponding path program 1 times [2025-01-09 22:47:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564474519] [2025-01-09 22:47:01,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:01,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:47:01,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:47:01,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:01,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564474519] [2025-01-09 22:47:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564474519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330667567] [2025-01-09 22:47:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:01,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:01,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:01,136 INFO L87 Difference]: Start difference. First operand 106502 states and 122884 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) [2025-01-09 22:47:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:01,334 INFO L93 Difference]: Finished difference Result 133123 states and 147458 transitions. [2025-01-09 22:47:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:01,335 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 [2025-01-09 22:47:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:01,335 INFO L225 Difference]: With dead ends: 133123 [2025-01-09 22:47:01,335 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:47:01,335 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 [2025-01-09 22:47:01,336 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 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 [2025-01-09 22:47:01,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:47:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:47:01,336 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) [2025-01-09 22:47:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:47:01,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-01-09 22:47:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:47:01,337 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) [2025-01-09 22:47:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:47:01,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:47:01,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-01-09 22:47:01,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-01-09 22:47:01,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:47:01,341 INFO L422 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] [2025-01-09 22:47:01,342 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:47:01,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:47:01 BoogieIcfgContainer [2025-01-09 22:47:01,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:47:01,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:47:01,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:47:01,345 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:47:01,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:50" (3/4) ... [2025-01-09 22:47:01,346 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:47:01,354 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 22:47:01,355 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 22:47:01,355 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 22:47:01,355 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:47:01,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:47:01,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:47:01,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:47:01,412 INFO L158 Benchmark]: Toolchain (without parser) took 11269.67ms. Allocated memory was 142.6MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 113.6MB in the beginning and 6.9GB in the end (delta: -6.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-01-09 22:47:01,412 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:01,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.18ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 101.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:01,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.85ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:01,413 INFO L158 Benchmark]: Boogie Preprocessor took 42.56ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:01,413 INFO L158 Benchmark]: RCFGBuilder took 339.78ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 82.7MB in the end (delta: 15.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:01,413 INFO L158 Benchmark]: TraceAbstraction took 10590.76ms. Allocated memory was 142.6MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 81.8MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-09 22:47:01,413 INFO L158 Benchmark]: Witness Printer took 67.14ms. Allocated memory is still 8.2GB. Free memory was 6.9GB in the beginning and 6.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:01,414 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.18ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 101.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.85ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.56ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 339.78ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 82.7MB in the end (delta: 15.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10590.76ms. Allocated memory was 142.6MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 81.8MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 67.14ms. Allocated memory is still 8.2GB. Free memory was 6.9GB in the beginning and 6.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1727 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1727 mSDsluCounter, 5642 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2198 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3444 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106502occurred in iteration=34, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 16449 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 824 ConstructedInterpolants, 0 QuantifiedInterpolants, 1756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:47:01,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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