./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/list-ext-properties/test-0513_1.i -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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:14:14,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:14:14,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:14:14,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:14:14,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:14:14,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:14:14,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:14:14,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:14:14,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:14:14,609 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:14:14,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:14:14,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:14:14,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:14:14,610 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:14:14,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:14:14,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:14:14,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:14:14,611 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2025-02-06 10:14:14,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:14:14,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:14:14,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:14:14,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:14:14,852 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:14:14,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2025-02-06 10:14:15,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24c9b027e/3c9cebf9f15949b6a7c3128cd1f3c9e2/FLAGf559fad81 [2025-02-06 10:14:16,290 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:14:16,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2025-02-06 10:14:16,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24c9b027e/3c9cebf9f15949b6a7c3128cd1f3c9e2/FLAGf559fad81 [2025-02-06 10:14:16,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24c9b027e/3c9cebf9f15949b6a7c3128cd1f3c9e2 [2025-02-06 10:14:16,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:14:16,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:14:16,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:14:16,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:14:16,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:14:16,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16, skipping insertion in model container [2025-02-06 10:14:16,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:14:16,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:14:16,829 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:14:16,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:14:16,886 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:14:16,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16 WrapperNode [2025-02-06 10:14:16,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:14:16,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:14:16,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:14:16,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:14:16,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,910 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-02-06 10:14:16,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:14:16,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:14:16,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:14:16,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:14:16,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,935 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2025-02-06 10:14:16,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:14:16,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:14:16,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:14:16,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:14:16,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (1/1) ... [2025-02-06 10:14:16,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:14:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:16,969 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-02-06 10:14:16,972 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-02-06 10:14:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:14:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:14:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:14:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:14:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:14:16,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:14:17,078 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:14:17,080 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:14:17,484 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2025-02-06 10:14:17,485 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:14:17,493 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:14:17,494 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:14:17,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:14:17 BoogieIcfgContainer [2025-02-06 10:14:17,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:14:17,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:14:17,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:14:17,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:14:17,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:14:16" (1/3) ... [2025-02-06 10:14:17,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8c55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:14:17, skipping insertion in model container [2025-02-06 10:14:17,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:16" (2/3) ... [2025-02-06 10:14:17,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8c55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:14:17, skipping insertion in model container [2025-02-06 10:14:17,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:14:17" (3/3) ... [2025-02-06 10:14:17,501 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2025-02-06 10:14:17,515 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:14:17,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0513_1.i that has 1 procedures, 151 locations, 1 initial locations, 4 loop locations, and 70 error locations. [2025-02-06 10:14:17,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:14:17,553 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;@61d0e616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:14:17,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-06 10:14:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.1) internal successors, (168), 150 states have internal predecessors, (168), 0 states have call successors, (0), 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-02-06 10:14:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:14:17,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:17,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:14:17,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 190827507, now seen corresponding path program 1 times [2025-02-06 10:14:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:17,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206566845] [2025-02-06 10:14:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:17,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:14:17,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:14:17,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:17,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206566845] [2025-02-06 10:14:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206566845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556090304] [2025-02-06 10:14:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:17,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:14:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:17,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:14:17,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:14:17,695 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.1) internal successors, (168), 150 states have internal predecessors, (168), 0 states have call successors, (0), 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-02-06 10:14:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:17,713 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2025-02-06 10:14:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:14:17,714 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-02-06 10:14:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:17,720 INFO L225 Difference]: With dead ends: 151 [2025-02-06 10:14:17,720 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 10:14:17,723 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-02-06 10:14:17,726 INFO L435 NwaCegarLoop]: 165 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, 165 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-02-06 10:14:17,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 10:14:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-02-06 10:14:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 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-02-06 10:14:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2025-02-06 10:14:17,755 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2025-02-06 10:14:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:17,756 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2025-02-06 10:14:17,756 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-02-06 10:14:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2025-02-06 10:14:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:14:17,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:17,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:17,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:14:17,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1297723504, now seen corresponding path program 1 times [2025-02-06 10:14:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820401018] [2025-02-06 10:14:17,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:17,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:14:17,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:14:17,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:17,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820401018] [2025-02-06 10:14:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820401018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995343974] [2025-02-06 10:14:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:17,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:17,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:17,801 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-06 10:14:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:17,948 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2025-02-06 10:14:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:17,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-06 10:14:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:17,951 INFO L225 Difference]: With dead ends: 197 [2025-02-06 10:14:17,951 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 10:14:17,951 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-02-06 10:14:17,951 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 44 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:17,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 10:14:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 153. [2025-02-06 10:14:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 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-02-06 10:14:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2025-02-06 10:14:17,960 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2025-02-06 10:14:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:17,961 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2025-02-06 10:14:17,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-06 10:14:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2025-02-06 10:14:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:14:17,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:17,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:17,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:14:17,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:17,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1297721085, now seen corresponding path program 1 times [2025-02-06 10:14:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:17,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827030066] [2025-02-06 10:14:17,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:17,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:17,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:14:17,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:14:17,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:17,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827030066] [2025-02-06 10:14:18,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827030066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467133007] [2025-02-06 10:14:18,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:18,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:18,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:18,024 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-06 10:14:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:18,166 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2025-02-06 10:14:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-06 10:14:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:18,167 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:14:18,168 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 10:14:18,169 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-02-06 10:14:18,169 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:18,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 183 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 10:14:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2025-02-06 10:14:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 87 states have (on average 1.9770114942528736) internal successors, (172), 151 states have internal predecessors, (172), 0 states have call successors, (0), 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-02-06 10:14:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2025-02-06 10:14:18,176 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 7 [2025-02-06 10:14:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:18,176 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2025-02-06 10:14:18,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-06 10:14:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2025-02-06 10:14:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:14:18,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:18,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:18,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:14:18,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1297721084, now seen corresponding path program 1 times [2025-02-06 10:14:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975547603] [2025-02-06 10:14:18,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:18,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:14:18,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:14:18,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:18,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975547603] [2025-02-06 10:14:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975547603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371155529] [2025-02-06 10:14:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:18,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:18,290 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-06 10:14:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:18,371 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2025-02-06 10:14:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-06 10:14:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:18,372 INFO L225 Difference]: With dead ends: 148 [2025-02-06 10:14:18,372 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 10:14:18,372 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-02-06 10:14:18,373 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:18,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 204 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 10:14:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-06 10:14:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 87 states have (on average 1.9310344827586208) internal successors, (168), 147 states have internal predecessors, (168), 0 states have call successors, (0), 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-02-06 10:14:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2025-02-06 10:14:18,380 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 7 [2025-02-06 10:14:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:18,380 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2025-02-06 10:14:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-06 10:14:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2025-02-06 10:14:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:14:18,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:18,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:18,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:14:18,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:18,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1574718352, now seen corresponding path program 1 times [2025-02-06 10:14:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290960454] [2025-02-06 10:14:18,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:18,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:14:18,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:14:18,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290960454] [2025-02-06 10:14:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290960454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:14:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143033118] [2025-02-06 10:14:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:18,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:18,418 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:18,462 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2025-02-06 10:14:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:14:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:18,463 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:14:18,463 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 10:14:18,463 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-02-06 10:14:18,464 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 14 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:18,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 264 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 10:14:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 10:14:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 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-02-06 10:14:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2025-02-06 10:14:18,473 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 8 [2025-02-06 10:14:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:18,473 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2025-02-06 10:14:18,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2025-02-06 10:14:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:14:18,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:18,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:18,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:14:18,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:18,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash 596706837, now seen corresponding path program 1 times [2025-02-06 10:14:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596563467] [2025-02-06 10:14:18,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:18,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:18,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:14:18,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:14:18,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:18,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596563467] [2025-02-06 10:14:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596563467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:14:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393192105] [2025-02-06 10:14:18,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:14:18,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:14:18,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:18,545 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-06 10:14:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:18,571 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2025-02-06 10:14:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:14:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-06 10:14:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:18,573 INFO L225 Difference]: With dead ends: 295 [2025-02-06 10:14:18,573 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 10:14:18,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:18,573 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 147 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:18,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 454 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 10:14:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2025-02-06 10:14:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 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-02-06 10:14:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-02-06 10:14:18,578 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2025-02-06 10:14:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:18,578 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-02-06 10:14:18,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-06 10:14:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-02-06 10:14:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:14:18,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:18,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:14:18,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:18,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1689231696, now seen corresponding path program 1 times [2025-02-06 10:14:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122319491] [2025-02-06 10:14:18,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:18,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:14:18,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:14:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122319491] [2025-02-06 10:14:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122319491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022922949] [2025-02-06 10:14:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:18,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:18,649 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-06 10:14:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:18,721 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2025-02-06 10:14:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-06 10:14:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:18,722 INFO L225 Difference]: With dead ends: 156 [2025-02-06 10:14:18,722 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 10:14:18,723 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-02-06 10:14:18,723 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:18,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 205 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 10:14:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-06 10:14:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 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-02-06 10:14:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2025-02-06 10:14:18,732 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2025-02-06 10:14:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:18,732 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2025-02-06 10:14:18,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-06 10:14:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2025-02-06 10:14:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:14:18,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:18,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:18,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:14:18,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:18,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1689231695, now seen corresponding path program 1 times [2025-02-06 10:14:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979419690] [2025-02-06 10:14:18,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:18,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:14:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:14:18,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:18,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979419690] [2025-02-06 10:14:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979419690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472624841] [2025-02-06 10:14:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:18,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:18,839 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-06 10:14:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:18,909 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2025-02-06 10:14:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:18,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-06 10:14:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:18,911 INFO L225 Difference]: With dead ends: 153 [2025-02-06 10:14:18,911 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 10:14:18,911 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-02-06 10:14:18,912 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:18,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 216 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 10:14:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 10:14:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 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-02-06 10:14:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2025-02-06 10:14:18,917 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2025-02-06 10:14:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:18,917 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2025-02-06 10:14:18,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-06 10:14:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2025-02-06 10:14:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:14:18,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:18,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:18,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:14:18,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:18,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -36826822, now seen corresponding path program 1 times [2025-02-06 10:14:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94299245] [2025-02-06 10:14:18,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:18,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:14:18,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:14:18,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:18,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94299245] [2025-02-06 10:14:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94299245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:18,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:14:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198705995] [2025-02-06 10:14:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:14:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:14:18,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:18,997 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-02-06 10:14:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:19,113 INFO L93 Difference]: Finished difference Result 223 states and 265 transitions. [2025-02-06 10:14:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:14:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-02-06 10:14:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:19,114 INFO L225 Difference]: With dead ends: 223 [2025-02-06 10:14:19,114 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 10:14:19,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:14:19,115 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 98 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:19,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 432 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 10:14:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2025-02-06 10:14:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 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-02-06 10:14:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2025-02-06 10:14:19,119 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2025-02-06 10:14:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:19,119 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2025-02-06 10:14:19,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-02-06 10:14:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2025-02-06 10:14:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:14:19,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:19,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:19,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:14:19,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:19,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1141626874, now seen corresponding path program 1 times [2025-02-06 10:14:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533981619] [2025-02-06 10:14:19,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:19,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:14:19,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:14:19,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:19,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:19,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533981619] [2025-02-06 10:14:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533981619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:19,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:14:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968852979] [2025-02-06 10:14:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:19,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:14:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:19,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:14:19,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:19,202 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-02-06 10:14:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:19,328 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2025-02-06 10:14:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:14:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-02-06 10:14:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:19,329 INFO L225 Difference]: With dead ends: 147 [2025-02-06 10:14:19,329 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 10:14:19,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:19,330 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:19,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 244 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 10:14:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 10:14:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 146 states have internal predecessors, (165), 0 states have call successors, (0), 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-02-06 10:14:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2025-02-06 10:14:19,332 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 25 [2025-02-06 10:14:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2025-02-06 10:14:19,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-02-06 10:14:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2025-02-06 10:14:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:14:19,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:19,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:19,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:14:19,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1141626873, now seen corresponding path program 1 times [2025-02-06 10:14:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019073397] [2025-02-06 10:14:19,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:19,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:14:19,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:14:19,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:19,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019073397] [2025-02-06 10:14:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019073397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:19,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:19,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:14:19,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844386923] [2025-02-06 10:14:19,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:19,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:14:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:19,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:14:19,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:19,466 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-02-06 10:14:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:19,631 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2025-02-06 10:14:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:14:19,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-02-06 10:14:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:19,632 INFO L225 Difference]: With dead ends: 210 [2025-02-06 10:14:19,632 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 10:14:19,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:14:19,632 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 87 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:19,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 256 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 10:14:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2025-02-06 10:14:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 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-02-06 10:14:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2025-02-06 10:14:19,640 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 25 [2025-02-06 10:14:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2025-02-06 10:14:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-02-06 10:14:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2025-02-06 10:14:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:14:19,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:19,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 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-02-06 10:14:19,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:14:19,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -315790586, now seen corresponding path program 1 times [2025-02-06 10:14:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-02-06 10:14:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:19,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:14:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:14:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-02-06 10:14:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929348154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:19,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:19,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:14:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476403383] [2025-02-06 10:14:19,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:14:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:19,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:14:19,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:14:19,935 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-02-06 10:14:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:20,035 INFO L93 Difference]: Finished difference Result 200 states and 252 transitions. [2025-02-06 10:14:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:14:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-02-06 10:14:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:20,036 INFO L225 Difference]: With dead ends: 200 [2025-02-06 10:14:20,036 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 10:14:20,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:14:20,037 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 7 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:20,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 430 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 10:14:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2025-02-06 10:14:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 151 states have (on average 1.6357615894039734) internal successors, (247), 194 states have internal predecessors, (247), 0 states have call successors, (0), 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-02-06 10:14:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2025-02-06 10:14:20,042 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 30 [2025-02-06 10:14:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2025-02-06 10:14:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-02-06 10:14:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2025-02-06 10:14:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:14:20,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:20,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 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-02-06 10:14:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:14:20,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:20,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -317114264, now seen corresponding path program 1 times [2025-02-06 10:14:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234628593] [2025-02-06 10:14:20,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:20,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:14:20,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:14:20,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:20,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:20,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234628593] [2025-02-06 10:14:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234628593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:20,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:20,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:14:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712451400] [2025-02-06 10:14:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:20,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:14:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:20,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:14:20,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:20,156 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-02-06 10:14:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:20,224 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2025-02-06 10:14:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:14:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-02-06 10:14:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:20,225 INFO L225 Difference]: With dead ends: 219 [2025-02-06 10:14:20,225 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 10:14:20,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:14:20,226 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 86 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:20,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 326 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 10:14:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 196. [2025-02-06 10:14:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 152 states have (on average 1.631578947368421) internal successors, (248), 195 states have internal predecessors, (248), 0 states have call successors, (0), 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-02-06 10:14:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2025-02-06 10:14:20,232 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 30 [2025-02-06 10:14:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:20,232 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2025-02-06 10:14:20,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-02-06 10:14:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2025-02-06 10:14:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:14:20,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:20,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 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-02-06 10:14:20,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:14:20,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:20,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1777008626, now seen corresponding path program 1 times [2025-02-06 10:14:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509884123] [2025-02-06 10:14:20,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:20,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:14:20,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:14:20,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:20,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:20,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509884123] [2025-02-06 10:14:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509884123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:20,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:14:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694811589] [2025-02-06 10:14:20,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:20,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:14:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:20,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:14:20,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:14:20,474 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:20,745 INFO L93 Difference]: Finished difference Result 281 states and 347 transitions. [2025-02-06 10:14:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:14:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 10:14:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:20,746 INFO L225 Difference]: With dead ends: 281 [2025-02-06 10:14:20,746 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 10:14:20,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:14:20,747 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 108 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:20,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 681 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:14:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 10:14:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 222. [2025-02-06 10:14:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 221 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-02-06 10:14:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2025-02-06 10:14:20,750 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 33 [2025-02-06 10:14:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:20,751 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2025-02-06 10:14:20,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2025-02-06 10:14:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:14:20,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:20,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 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-02-06 10:14:20,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:14:20,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1777009362, now seen corresponding path program 1 times [2025-02-06 10:14:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169968780] [2025-02-06 10:14:20,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:20,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:14:20,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:14:20,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:21,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169968780] [2025-02-06 10:14:21,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169968780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:21,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:14:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901290545] [2025-02-06 10:14:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:21,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:14:21,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:21,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:14:21,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:14:21,068 INFO L87 Difference]: Start difference. First operand 222 states and 280 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:21,357 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2025-02-06 10:14:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:14:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 10:14:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:21,360 INFO L225 Difference]: With dead ends: 253 [2025-02-06 10:14:21,360 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 10:14:21,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:14:21,361 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 105 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:21,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 399 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:14:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 10:14:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 223. [2025-02-06 10:14:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 179 states have (on average 1.5754189944134078) internal successors, (282), 222 states have internal predecessors, (282), 0 states have call successors, (0), 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-02-06 10:14:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 282 transitions. [2025-02-06 10:14:21,368 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 282 transitions. Word has length 33 [2025-02-06 10:14:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:21,368 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 282 transitions. [2025-02-06 10:14:21,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 282 transitions. [2025-02-06 10:14:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:14:21,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:21,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 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-02-06 10:14:21,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:14:21,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:21,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1777009363, now seen corresponding path program 1 times [2025-02-06 10:14:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127534686] [2025-02-06 10:14:21,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:21,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:14:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:14:21,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:21,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127534686] [2025-02-06 10:14:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127534686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:21,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:14:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431219972] [2025-02-06 10:14:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:14:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:21,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:14:21,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:14:21,703 INFO L87 Difference]: Start difference. First operand 223 states and 282 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:21,944 INFO L93 Difference]: Finished difference Result 281 states and 345 transitions. [2025-02-06 10:14:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:14:21,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 10:14:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:21,946 INFO L225 Difference]: With dead ends: 281 [2025-02-06 10:14:21,946 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 10:14:21,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:14:21,947 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 118 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:21,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 322 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:14:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 10:14:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 223. [2025-02-06 10:14:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 222 states have internal predecessors, (281), 0 states have call successors, (0), 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-02-06 10:14:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 281 transitions. [2025-02-06 10:14:21,951 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 281 transitions. Word has length 33 [2025-02-06 10:14:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:21,951 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 281 transitions. [2025-02-06 10:14:21,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 281 transitions. [2025-02-06 10:14:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:14:21,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:21,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:21,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:14:21,952 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:21,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1690987185, now seen corresponding path program 1 times [2025-02-06 10:14:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109989732] [2025-02-06 10:14:21,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:21,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:14:21,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:14:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:14:21,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:21,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109989732] [2025-02-06 10:14:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109989732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:21,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:14:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477946449] [2025-02-06 10:14:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:21,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:14:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:21,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:14:21,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:21,994 INFO L87 Difference]: Start difference. First operand 223 states and 281 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:22,135 INFO L93 Difference]: Finished difference Result 289 states and 370 transitions. [2025-02-06 10:14:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:14:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 10:14:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:22,136 INFO L225 Difference]: With dead ends: 289 [2025-02-06 10:14:22,136 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 10:14:22,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:22,137 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 77 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:22,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 10:14:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 225. [2025-02-06 10:14:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 185 states have (on average 1.5675675675675675) internal successors, (290), 224 states have internal predecessors, (290), 0 states have call successors, (0), 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-02-06 10:14:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 290 transitions. [2025-02-06 10:14:22,141 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 290 transitions. Word has length 35 [2025-02-06 10:14:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:22,141 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 290 transitions. [2025-02-06 10:14:22,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 290 transitions. [2025-02-06 10:14:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:14:22,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:22,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:22,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:14:22,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1690987184, now seen corresponding path program 1 times [2025-02-06 10:14:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617648177] [2025-02-06 10:14:22,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:22,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:14:22,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:14:22,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:22,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:22,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617648177] [2025-02-06 10:14:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617648177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:22,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:22,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:14:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411243460] [2025-02-06 10:14:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:22,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:14:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:22,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:14:22,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:14:22,568 INFO L87 Difference]: Start difference. First operand 225 states and 290 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:14:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:22,920 INFO L93 Difference]: Finished difference Result 294 states and 368 transitions. [2025-02-06 10:14:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:14:22,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-06 10:14:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:22,921 INFO L225 Difference]: With dead ends: 294 [2025-02-06 10:14:22,921 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 10:14:22,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:14:22,921 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 129 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:22,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 413 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:14:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 10:14:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 230. [2025-02-06 10:14:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.5578947368421052) internal successors, (296), 229 states have internal predecessors, (296), 0 states have call successors, (0), 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-02-06 10:14:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 296 transitions. [2025-02-06 10:14:22,928 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 296 transitions. Word has length 35 [2025-02-06 10:14:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:22,929 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 296 transitions. [2025-02-06 10:14:22,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-06 10:14:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 296 transitions. [2025-02-06 10:14:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:14:22,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:22,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:14:22,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:22,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 817278476, now seen corresponding path program 1 times [2025-02-06 10:14:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58878758] [2025-02-06 10:14:22,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:22,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:22,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:14:22,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:14:22,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:22,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:14:22,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58878758] [2025-02-06 10:14:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58878758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:22,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:22,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:14:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545151508] [2025-02-06 10:14:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:22,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:22,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:22,967 INFO L87 Difference]: Start difference. First operand 230 states and 296 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-02-06 10:14:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:22,973 INFO L93 Difference]: Finished difference Result 231 states and 297 transitions. [2025-02-06 10:14:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 39 [2025-02-06 10:14:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:22,975 INFO L225 Difference]: With dead ends: 231 [2025-02-06 10:14:22,975 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 10:14:22,975 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-02-06 10:14:22,975 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:22,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 10:14:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-06 10:14:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 230 states have internal predecessors, (297), 0 states have call successors, (0), 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-02-06 10:14:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2025-02-06 10:14:22,980 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 39 [2025-02-06 10:14:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:22,980 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2025-02-06 10:14:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-02-06 10:14:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2025-02-06 10:14:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:14:22,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:22,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:14:22,981 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:22,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash -434170244, now seen corresponding path program 1 times [2025-02-06 10:14:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840235407] [2025-02-06 10:14:22,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:22,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:14:23,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:14:23,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840235407] [2025-02-06 10:14:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840235407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678644062] [2025-02-06 10:14:23,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:23,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:23,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:14:23,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:14:23,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:14:23,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:23,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:23,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:14:23,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:23,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:14:23,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:14:23,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:14:23,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:14:23,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:14:23,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:14:23,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-06 10:14:23,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:14:23,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:23,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2025-02-06 10:14:23,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:23,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2025-02-06 10:14:24,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 10:14:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:24,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:24,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2025-02-06 10:14:24,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-02-06 10:14:24,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse6 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (.cse1 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse7 .cse3)) (< 1 (select .cse7 (+ 4 v_arrayElimCell_11))))))) (.cse5 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (and (or .cse0 .cse1) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse2 v_arrayElimCell_10))) (or (< 1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (< 1 (select .cse4 .cse3)) (< 1 (select .cse4 (+ 4 v_arrayElimCell_11))))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3))) (not .cse0) (not .cse5)) (or .cse0 .cse6) (or .cse6 .cse5) (or .cse1 .cse5)))) is different from false [2025-02-06 10:14:24,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (and (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse1 .cse2)) (< 1 (select .cse1 (+ 4 v_arrayElimCell_11))))))) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse3 v_arrayElimCell_10))) (or (< 1 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (< 1 (select .cse4 .cse2)) (< 1 (select .cse4 (+ 4 v_arrayElimCell_11))))))) (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not .cse0)))) is different from false [2025-02-06 10:14:24,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:24,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 74 [2025-02-06 10:14:24,675 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2025-02-06 10:14:24,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 115 [2025-02-06 10:14:24,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:24,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 88 [2025-02-06 10:14:24,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2025-02-06 10:14:25,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:25,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 65 [2025-02-06 10:14:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678644062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:14:25,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:14:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2025-02-06 10:14:25,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90328823] [2025-02-06 10:14:25,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:14:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:14:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:25,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:14:25,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1152, Unknown=2, NotChecked=138, Total=1406 [2025-02-06 10:14:25,262 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 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-02-06 10:14:25,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (and (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse1 .cse2)) (< 1 (select .cse1 (+ 4 v_arrayElimCell_11))))))) (< 1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse3 v_arrayElimCell_10))) (or (< 1 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (< 1 (select .cse4 .cse2)) (< 1 (select .cse4 (+ 4 v_arrayElimCell_11))))))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse6 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604))) (let ((.cse5 (select .cse6 v_arrayElimCell_10))) (or (< 1 (select .cse5 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse5 .cse2)) (< 1 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not .cse0)) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|))) is different from false [2025-02-06 10:14:30,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:14:33,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse3 (< 0 (+ 2 |c_ULTIMATE.start_main_~c1~0#1|)))) (and (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10))) (or (< 1 (select .cse1 .cse2)) (< 1 (select .cse1 (+ 4 v_arrayElimCell_11))))))) (< 1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (or .cse3 (forall ((v_prenex_5 Int)) (not (= (select |c_#valid| v_prenex_5) 0)))) (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604))) (let ((.cse5 (select .cse4 v_arrayElimCell_10))) (or (< 1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (< 1 (select .cse5 .cse2)) (< 1 (select .cse5 (+ 4 v_arrayElimCell_11))))))) (<= 0 |c_ULTIMATE.start_main_~c1~0#1|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (or (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~lItem~0#1.base_40| v_ArrVal_604))) (let ((.cse6 (select .cse7 v_arrayElimCell_10))) (or (< 1 (select .cse6 (+ 4 v_arrayElimCell_11))) (< 1 (select .cse6 .cse2)) (< 1 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))) (or .cse0 (forall ((v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))))) (or (forall ((v_ArrVal_604 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not .cse0)) (or .cse3 (forall ((v_arrayElimCell_10 Int)) (not (= (select |c_#valid| v_arrayElimCell_10) 0)))) (or .cse3 (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_40| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_40|) 0)))))) is different from false [2025-02-06 10:14:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:36,753 INFO L93 Difference]: Finished difference Result 455 states and 583 transitions. [2025-02-06 10:14:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:14:36,754 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 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 40 [2025-02-06 10:14:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:36,755 INFO L225 Difference]: With dead ends: 455 [2025-02-06 10:14:36,755 INFO L226 Difference]: Without dead ends: 455 [2025-02-06 10:14:36,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=389, Invalid=2703, Unknown=4, NotChecked=444, Total=3540 [2025-02-06 10:14:36,757 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 316 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 606 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:36,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1788 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1787 Invalid, 1 Unknown, 606 Unchecked, 9.9s Time] [2025-02-06 10:14:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-06 10:14:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 242. [2025-02-06 10:14:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 202 states have (on average 1.5247524752475248) internal successors, (308), 241 states have internal predecessors, (308), 0 states have call successors, (0), 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-02-06 10:14:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 308 transitions. [2025-02-06 10:14:36,763 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 308 transitions. Word has length 40 [2025-02-06 10:14:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:36,763 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 308 transitions. [2025-02-06 10:14:36,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 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-02-06 10:14:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 308 transitions. [2025-02-06 10:14:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:14:36,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:36,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:36,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:14:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:36,977 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:36,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -575230678, now seen corresponding path program 1 times [2025-02-06 10:14:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588824848] [2025-02-06 10:14:36,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:36,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:14:37,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:14:37,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:37,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588824848] [2025-02-06 10:14:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588824848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:14:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376148266] [2025-02-06 10:14:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:14:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:37,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:14:37,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:14:37,759 INFO L87 Difference]: Start difference. First operand 242 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-06 10:14:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:39,313 INFO L93 Difference]: Finished difference Result 307 states and 380 transitions. [2025-02-06 10:14:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:14:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-06 10:14:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:39,314 INFO L225 Difference]: With dead ends: 307 [2025-02-06 10:14:39,314 INFO L226 Difference]: Without dead ends: 307 [2025-02-06 10:14:39,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:14:39,314 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 126 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:39,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 485 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 10:14:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-06 10:14:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 245. [2025-02-06 10:14:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 205 states have (on average 1.5219512195121951) internal successors, (312), 244 states have internal predecessors, (312), 0 states have call successors, (0), 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-02-06 10:14:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 312 transitions. [2025-02-06 10:14:39,318 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 312 transitions. Word has length 41 [2025-02-06 10:14:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 312 transitions. [2025-02-06 10:14:39,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-06 10:14:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2025-02-06 10:14:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:14:39,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:39,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:14:39,320 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -652281858, now seen corresponding path program 1 times [2025-02-06 10:14:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504597548] [2025-02-06 10:14:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:39,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:14:39,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:14:39,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:39,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504597548] [2025-02-06 10:14:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504597548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:14:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128858153] [2025-02-06 10:14:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:14:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:14:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:14:39,982 INFO L87 Difference]: Start difference. First operand 245 states and 312 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-02-06 10:14:42,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:42,246 INFO L93 Difference]: Finished difference Result 308 states and 381 transitions. [2025-02-06 10:14:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:14:42,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-06 10:14:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:42,250 INFO L225 Difference]: With dead ends: 308 [2025-02-06 10:14:42,250 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 10:14:42,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:14:42,251 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 128 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:42,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 548 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 10:14:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 10:14:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 246. [2025-02-06 10:14:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 206 states have (on average 1.5194174757281553) internal successors, (313), 245 states have internal predecessors, (313), 0 states have call successors, (0), 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-02-06 10:14:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 313 transitions. [2025-02-06 10:14:42,254 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 313 transitions. Word has length 42 [2025-02-06 10:14:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 313 transitions. [2025-02-06 10:14:42,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-02-06 10:14:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 313 transitions. [2025-02-06 10:14:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:14:42,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:42,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:14:42,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -652281058, now seen corresponding path program 1 times [2025-02-06 10:14:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996704594] [2025-02-06 10:14:42,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:42,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:14:42,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:14:42,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:42,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996704594] [2025-02-06 10:14:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996704594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:44,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 10:14:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852155202] [2025-02-06 10:14:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:44,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:14:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:44,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:14:44,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:14:44,563 INFO L87 Difference]: Start difference. First operand 246 states and 313 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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-02-06 10:14:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:48,579 INFO L93 Difference]: Finished difference Result 258 states and 325 transitions. [2025-02-06 10:14:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:14:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-06 10:14:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:48,580 INFO L225 Difference]: With dead ends: 258 [2025-02-06 10:14:48,580 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 10:14:48,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:14:48,581 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 59 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1030 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 10:14:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 10:14:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2025-02-06 10:14:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5119617224880382) internal successors, (316), 248 states have internal predecessors, (316), 0 states have call successors, (0), 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-02-06 10:14:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 316 transitions. [2025-02-06 10:14:48,584 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 316 transitions. Word has length 42 [2025-02-06 10:14:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:48,584 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 316 transitions. [2025-02-06 10:14:48,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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-02-06 10:14:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2025-02-06 10:14:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:14:48,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:48,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:14:48,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:14:48,585 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:14:48,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1696810427, now seen corresponding path program 1 times [2025-02-06 10:14:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299489481] [2025-02-06 10:14:48,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:48,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:14:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:14:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:49,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:49,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299489481] [2025-02-06 10:14:49,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299489481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:49,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400143164] [2025-02-06 10:14:49,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:49,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:49,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:14:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:14:49,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:14:49,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:49,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:49,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:14:49,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:49,804 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:14:49,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-02-06 10:14:50,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:14:50,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:50,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-06 10:14:50,926 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:14:50,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-02-06 10:14:51,125 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_46| Int)) (and (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46| 0) |c_ULTIMATE.start_main_~item2~0#1.base| 0)) (= (select |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46|) 0))) is different from true [2025-02-06 10:14:51,432 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-02-06 10:14:51,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2025-02-06 10:14:51,484 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_46| Int) (|v_ULTIMATE.start_main_~item2~0#1.base_33| Int)) (and (= (store (store |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46| 0) |v_ULTIMATE.start_main_~item2~0#1.base_33| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= (select |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_46|) 0) (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item2~0#1.base_33|)))) is different from true [2025-02-06 10:14:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 10:14:51,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-02-06 10:15:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400143164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:10,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:10,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 26 [2025-02-06 10:15:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248252496] [2025-02-06 10:15:10,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:10,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:15:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:10,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:15:10,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=520, Unknown=6, NotChecked=94, Total=702 [2025-02-06 10:15:10,178 INFO L87 Difference]: Start difference. First operand 249 states and 316 transitions. Second operand has 27 states, 26 states have (on average 4.115384615384615) internal successors, (107), 27 states have internal predecessors, (107), 0 states have call successors, (0), 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-02-06 10:15:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:15,449 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2025-02-06 10:15:15,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:15:15,449 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.115384615384615) internal successors, (107), 27 states have internal predecessors, (107), 0 states have call successors, (0), 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 45 [2025-02-06 10:15:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:15,450 INFO L225 Difference]: With dead ends: 274 [2025-02-06 10:15:15,450 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 10:15:15,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=128, Invalid=866, Unknown=6, NotChecked=122, Total=1122 [2025-02-06 10:15:15,451 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 37 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:15,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1065 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1104 Invalid, 0 Unknown, 379 Unchecked, 4.5s Time] [2025-02-06 10:15:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 10:15:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2025-02-06 10:15:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 222 states have (on average 1.509009009009009) internal successors, (335), 261 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-06 10:15:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 335 transitions. [2025-02-06 10:15:15,457 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 335 transitions. Word has length 45 [2025-02-06 10:15:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:15,457 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 335 transitions. [2025-02-06 10:15:15,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.115384615384615) internal successors, (107), 27 states have internal predecessors, (107), 0 states have call successors, (0), 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-02-06 10:15:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 335 transitions. [2025-02-06 10:15:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:15:15,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:15,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 10:15:15,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:15:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:15,658 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:15:15,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1696809691, now seen corresponding path program 1 times [2025-02-06 10:15:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336764514] [2025-02-06 10:15:15,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:15:15,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:15:15,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:15,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:17,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336764514] [2025-02-06 10:15:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336764514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530588858] [2025-02-06 10:15:17,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:17,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:17,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:17,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:17,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:15:17,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:15:17,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:15:17,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:17,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:17,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 10:15:17,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:17,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:15:17,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:15:17,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:15:17,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:15:17,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:15:17,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:15:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:15:17,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:15:18,000 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:15:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 10:15:18,102 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:15:18,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 10:15:18,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-02-06 10:15:18,524 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:15:18,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2025-02-06 10:15:19,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:15:20,813 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2025-02-06 10:15:20,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 121 [2025-02-06 10:15:21,110 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2025-02-06 10:15:21,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 89 [2025-02-06 10:15:21,184 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:15:21,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2025-02-06 10:15:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:21,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:22,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:15:24,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-02-06 10:15:24,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse0 (not .cse3))) (and (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_913 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_913 (Array Int Int)) (v_arrayElimCell_49 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse1 v_arrayElimCell_49) 0) 0)))))))) (forall ((v_ArrVal_911 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (select (store v_ArrVal_911 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse2) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_911) .cse2) 0) 0)))) (or .cse0 (forall ((v_ArrVal_913 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse3 (forall ((v_ArrVal_913 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_49 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913) v_arrayElimCell_49) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_49)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_49 Int)) (or (forall ((v_ArrVal_913 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913))) (or (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse4 v_arrayElimCell_49) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_49))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse3 (and (forall ((v_ArrVal_913 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_49 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913) v_arrayElimCell_49) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_49))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_49 Int)) (or (forall ((v_ArrVal_913 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_913))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse5 v_arrayElimCell_49) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_49)))))))) is different from false [2025-02-06 10:15:25,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:15:25,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-02-06 10:15:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530588858] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:25,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 40 [2025-02-06 10:15:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688384792] [2025-02-06 10:15:25,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:25,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:15:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:25,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:15:25,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1316, Unknown=9, NotChecked=74, Total=1560 [2025-02-06 10:15:25,803 INFO L87 Difference]: Start difference. First operand 262 states and 335 transitions. Second operand has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 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-02-06 10:15:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:32,811 INFO L93 Difference]: Finished difference Result 274 states and 344 transitions. [2025-02-06 10:15:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:15:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2025-02-06 10:15:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:32,812 INFO L225 Difference]: With dead ends: 274 [2025-02-06 10:15:32,812 INFO L226 Difference]: Without dead ends: 252 [2025-02-06 10:15:32,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=307, Invalid=2040, Unknown=9, NotChecked=94, Total=2450 [2025-02-06 10:15:32,813 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 101 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:32,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1684 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1448 Invalid, 0 Unknown, 108 Unchecked, 5.3s Time] [2025-02-06 10:15:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-06 10:15:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 231. [2025-02-06 10:15:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 230 states have internal predecessors, (297), 0 states have call successors, (0), 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-02-06 10:15:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2025-02-06 10:15:32,816 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 45 [2025-02-06 10:15:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:32,816 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2025-02-06 10:15:32,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 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-02-06 10:15:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2025-02-06 10:15:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:15:32,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:32,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-02-06 10:15:32,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:15:33,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:33,021 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:15:33,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 439122491, now seen corresponding path program 1 times [2025-02-06 10:15:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492897127] [2025-02-06 10:15:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:33,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:33,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:15:33,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:15:33,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:33,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:33,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:33,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492897127] [2025-02-06 10:15:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492897127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037144844] [2025-02-06 10:15:33,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:33,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:33,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:33,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:15:33,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:15:33,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:15:33,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:33,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:33,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:15:33,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:15:33,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:15:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037144844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:15:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:15:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 10:15:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166545355] [2025-02-06 10:15:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:15:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:15:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:33,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:15:33,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:15:33,396 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-06 10:15:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:33,538 INFO L93 Difference]: Finished difference Result 396 states and 509 transitions. [2025-02-06 10:15:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:15:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 46 [2025-02-06 10:15:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:33,539 INFO L225 Difference]: With dead ends: 396 [2025-02-06 10:15:33,539 INFO L226 Difference]: Without dead ends: 394 [2025-02-06 10:15:33,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:15:33,540 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:33,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 384 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:15:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-06 10:15:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 242. [2025-02-06 10:15:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 202 states have (on average 1.504950495049505) internal successors, (304), 241 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 304 transitions. [2025-02-06 10:15:33,544 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 304 transitions. Word has length 46 [2025-02-06 10:15:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:33,544 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 304 transitions. [2025-02-06 10:15:33,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-06 10:15:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 304 transitions. [2025-02-06 10:15:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:15:33,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:33,544 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-02-06 10:15:33,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:15:33,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 10:15:33,746 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:15:33,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash 242608986, now seen corresponding path program 1 times [2025-02-06 10:15:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182328144] [2025-02-06 10:15:33,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:33,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:15:33,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:15:33,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:33,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:33,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182328144] [2025-02-06 10:15:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182328144] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201305195] [2025-02-06 10:15:33,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:33,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:33,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:15:33,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:15:33,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:15:33,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:33,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:15:33,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:34,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201305195] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:34,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:34,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2025-02-06 10:15:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886704644] [2025-02-06 10:15:34,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:34,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:15:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:34,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:15:34,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:15:34,480 INFO L87 Difference]: Start difference. First operand 242 states and 304 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-02-06 10:15:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:34,739 INFO L93 Difference]: Finished difference Result 1039 states and 1365 transitions. [2025-02-06 10:15:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:15:34,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) Word has length 46 [2025-02-06 10:15:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:34,742 INFO L225 Difference]: With dead ends: 1039 [2025-02-06 10:15:34,742 INFO L226 Difference]: Without dead ends: 1039 [2025-02-06 10:15:34,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:15:34,743 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 805 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:34,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1044 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:15:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-02-06 10:15:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 275. [2025-02-06 10:15:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 235 states have (on average 1.4680851063829787) internal successors, (345), 274 states have internal predecessors, (345), 0 states have call successors, (0), 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-02-06 10:15:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 345 transitions. [2025-02-06 10:15:34,749 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 345 transitions. Word has length 46 [2025-02-06 10:15:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 345 transitions. [2025-02-06 10:15:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-02-06 10:15:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 345 transitions. [2025-02-06 10:15:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:15:34,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:34,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:34,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:15:34,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 10:15:34,950 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:15:34,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1930283260, now seen corresponding path program 1 times [2025-02-06 10:15:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729443285] [2025-02-06 10:15:34,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:34,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:15:34,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:15:34,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:34,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:35,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729443285] [2025-02-06 10:15:35,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729443285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466871404] [2025-02-06 10:15:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:35,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:35,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:35,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:15:35,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:15:35,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:15:35,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:35,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:35,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 10:15:35,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:35,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:15:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:15:36,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:15:36,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-02-06 10:15:36,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 10:15:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:36,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466871404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:41,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:41,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-02-06 10:15:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039998653] [2025-02-06 10:15:41,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:15:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:41,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:15:41,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2025-02-06 10:15:41,331 INFO L87 Difference]: Start difference. First operand 275 states and 345 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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-02-06 10:15:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:44,972 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2025-02-06 10:15:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:15:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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 48 [2025-02-06 10:15:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:44,973 INFO L225 Difference]: With dead ends: 299 [2025-02-06 10:15:44,973 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 10:15:44,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=198, Invalid=731, Unknown=1, NotChecked=0, Total=930 [2025-02-06 10:15:44,974 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 203 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 891 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 10:15:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 10:15:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 275. [2025-02-06 10:15:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 235 states have (on average 1.4638297872340424) internal successors, (344), 274 states have internal predecessors, (344), 0 states have call successors, (0), 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-02-06 10:15:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 344 transitions. [2025-02-06 10:15:44,976 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 344 transitions. Word has length 48 [2025-02-06 10:15:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:44,977 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 344 transitions. [2025-02-06 10:15:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 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-02-06 10:15:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2025-02-06 10:15:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:15:44,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:44,977 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:44,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:15:45,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:15:45,178 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:15:45,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1930283261, now seen corresponding path program 1 times [2025-02-06 10:15:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351727545] [2025-02-06 10:15:45,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:45,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:15:45,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:15:45,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:46,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:46,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351727545] [2025-02-06 10:15:46,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351727545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:15:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:15:46,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:15:46,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271707185] [2025-02-06 10:15:46,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:15:46,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:15:46,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:46,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:15:46,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:15:46,040 INFO L87 Difference]: Start difference. First operand 275 states and 344 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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-02-06 10:15:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:48,257 INFO L93 Difference]: Finished difference Result 298 states and 345 transitions. [2025-02-06 10:15:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:15:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-06 10:15:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:48,258 INFO L225 Difference]: With dead ends: 298 [2025-02-06 10:15:48,258 INFO L226 Difference]: Without dead ends: 298 [2025-02-06 10:15:48,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:15:48,259 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 90 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:48,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 684 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 10:15:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-06 10:15:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2025-02-06 10:15:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 235 states have (on average 1.4595744680851064) internal successors, (343), 274 states have internal predecessors, (343), 0 states have call successors, (0), 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-02-06 10:15:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 343 transitions. [2025-02-06 10:15:48,264 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 343 transitions. Word has length 48 [2025-02-06 10:15:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:48,264 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 343 transitions. [2025-02-06 10:15:48,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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-02-06 10:15:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 343 transitions. [2025-02-06 10:15:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:15:48,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:48,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-02-06 10:15:48,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 10:15:48,264 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 67 more)] === [2025-02-06 10:15:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1027516868, now seen corresponding path program 1 times [2025-02-06 10:15:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173092473] [2025-02-06 10:15:48,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:48,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:15:48,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:15:48,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:48,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173092473] [2025-02-06 10:15:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173092473] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697881032] [2025-02-06 10:15:48,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:48,770 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:48,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:15:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:15:48,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:15:48,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:48,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:48,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:15:48,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:49,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:15:49,458 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-06 10:15:49,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38