./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.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/forester-heap/dll-reverse.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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:33:21,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:33:21,999 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:33:22,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:33:22,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:33:22,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:33:22,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:33:22,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:33:22,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:33:22,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:33:22,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:33:22,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:33:22,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:33:22,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:33:22,031 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:33:22,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:33:22,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:33:22,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:33:22,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:33:22,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:33:22,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:33:22,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:33:22,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:22,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:33:22,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:33:22,034 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2025-02-06 10:33:22,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:33:22,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:33:22,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:33:22,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:33:22,270 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:33:22,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2025-02-06 10:33:23,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fceb446e/1592f13ccfdd460ab3e6a7442336c4a7/FLAGb2a54eb62 [2025-02-06 10:33:23,771 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:33:23,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2025-02-06 10:33:23,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fceb446e/1592f13ccfdd460ab3e6a7442336c4a7/FLAGb2a54eb62 [2025-02-06 10:33:23,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fceb446e/1592f13ccfdd460ab3e6a7442336c4a7 [2025-02-06 10:33:23,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:33:23,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:33:23,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:23,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:33:23,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:33:23,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:23" (1/1) ... [2025-02-06 10:33:23,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:23, skipping insertion in model container [2025-02-06 10:33:23,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:23" (1/1) ... [2025-02-06 10:33:23,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:33:23,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:23,979 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:33:24,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:24,021 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:33:24,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24 WrapperNode [2025-02-06 10:33:24,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:24,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:24,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:33:24,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:33:24,026 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:33:24" (1/1) ... [2025-02-06 10:33:24,033 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:33:24" (1/1) ... [2025-02-06 10:33:24,043 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2025-02-06 10:33:24,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:24,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:33:24,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:33:24,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:33:24,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,063 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-02-06 10:33:24,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:33:24,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:33:24,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:33:24,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:33:24,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (1/1) ... [2025-02-06 10:33:24,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:24,094 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:33:24,096 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:33:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:33:24,114 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:33:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:33:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:33:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:33:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:33:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:33:24,196 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:33:24,197 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:33:24,443 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-02-06 10:33:24,443 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:33:24,450 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:33:24,450 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:33:24,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:24 BoogieIcfgContainer [2025-02-06 10:33:24,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:33:24,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:33:24,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:33:24,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:33:24,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:33:23" (1/3) ... [2025-02-06 10:33:24,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50922862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:24, skipping insertion in model container [2025-02-06 10:33:24,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:24" (2/3) ... [2025-02-06 10:33:24,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50922862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:24, skipping insertion in model container [2025-02-06 10:33:24,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:24" (3/3) ... [2025-02-06 10:33:24,460 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2025-02-06 10:33:24,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:33:24,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 2 procedures, 154 locations, 1 initial locations, 8 loop locations, and 67 error locations. [2025-02-06 10:33:24,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:33:24,523 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;@246bd792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:33:24,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-02-06 10:33:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 82 states have (on average 2.073170731707317) internal successors, (170), 149 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:33:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:24,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:24,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:24,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:24,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 202539, now seen corresponding path program 1 times [2025-02-06 10:33:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:24,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148708991] [2025-02-06 10:33:24,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:24,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:24,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:33:24,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:33:24,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:24,692 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:33:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148708991] [2025-02-06 10:33:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148708991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839109674] [2025-02-06 10:33:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:24,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:24,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:24,717 INFO L87 Difference]: Start difference. First operand has 154 states, 82 states have (on average 2.073170731707317) internal successors, (170), 149 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:24,859 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2025-02-06 10:33:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-06 10:33:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:24,864 INFO L225 Difference]: With dead ends: 146 [2025-02-06 10:33:24,864 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 10:33:24,865 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:33:24,867 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 83 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:24,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 143 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 10:33:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-06 10:33:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 142 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2025-02-06 10:33:24,891 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 3 [2025-02-06 10:33:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:24,891 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2025-02-06 10:33:24,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2025-02-06 10:33:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:24,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:24,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:24,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:33:24,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash 202540, now seen corresponding path program 1 times [2025-02-06 10:33:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:24,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201612818] [2025-02-06 10:33:24,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:24,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:33:24,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:33:24,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:24,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:24,963 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:33:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201612818] [2025-02-06 10:33:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201612818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:24,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107710774] [2025-02-06 10:33:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:24,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:24,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:24,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:24,966 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:25,078 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2025-02-06 10:33:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:25,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-06 10:33:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:25,080 INFO L225 Difference]: With dead ends: 141 [2025-02-06 10:33:25,081 INFO L226 Difference]: Without dead ends: 141 [2025-02-06 10:33:25,082 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:33:25,082 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:25,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 139 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-06 10:33:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-06 10:33:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 77 states have (on average 1.922077922077922) internal successors, (148), 139 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2025-02-06 10:33:25,108 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 3 [2025-02-06 10:33:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2025-02-06 10:33:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2025-02-06 10:33:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:33:25,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:25,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:25,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:33:25,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:25,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 891844320, now seen corresponding path program 1 times [2025-02-06 10:33:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-02-06 10:33:25,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:25,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:33:25,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:33:25,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:25,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:25,335 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:33:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-02-06 10:33:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017334542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:25,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753750065] [2025-02-06 10:33:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:25,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:25,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:25,336 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:33:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:25,490 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2025-02-06 10:33:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:25,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-02-06 10:33:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:25,491 INFO L225 Difference]: With dead ends: 129 [2025-02-06 10:33:25,491 INFO L226 Difference]: Without dead ends: 129 [2025-02-06 10:33:25,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:33:25,492 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 125 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:25,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 97 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-06 10:33:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-06 10:33:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2025-02-06 10:33:25,497 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 9 [2025-02-06 10:33:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2025-02-06 10:33:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:33:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2025-02-06 10:33:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:33:25,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:25,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:33:25,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 891844321, now seen corresponding path program 1 times [2025-02-06 10:33:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156848148] [2025-02-06 10:33:25,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:25,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:33:25,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:33:25,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:25,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:25,627 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:33:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156848148] [2025-02-06 10:33:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156848148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:33:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648615193] [2025-02-06 10:33:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:25,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:25,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:25,629 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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:33:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:25,870 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2025-02-06 10:33:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:25,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-02-06 10:33:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:25,871 INFO L225 Difference]: With dead ends: 168 [2025-02-06 10:33:25,871 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 10:33:25,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:25,871 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 145 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:25,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 192 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 10:33:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2025-02-06 10:33:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.584070796460177) internal successors, (179), 158 states have internal predecessors, (179), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2025-02-06 10:33:25,877 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 9 [2025-02-06 10:33:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:25,877 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2025-02-06 10:33:25,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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:33:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2025-02-06 10:33:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:33:25,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:25,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:25,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:33:25,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 266566104, now seen corresponding path program 1 times [2025-02-06 10:33:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-02-06 10:33:25,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:25,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:33:25,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:33:25,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:25,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:25,955 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:33:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:25,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-02-06 10:33:25,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698821941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912530909] [2025-02-06 10:33:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:25,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:25,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:25,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:25,957 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:26,176 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2025-02-06 10:33:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:33:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:26,177 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:33:26,177 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:33:26,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:26,178 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:26,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 325 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:33:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 10:33:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 113 states have (on average 1.5663716814159292) internal successors, (177), 157 states have internal predecessors, (177), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2025-02-06 10:33:26,188 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 12 [2025-02-06 10:33:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:26,188 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2025-02-06 10:33:26,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2025-02-06 10:33:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:33:26,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:26,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:26,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:33:26,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:26,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 266566105, now seen corresponding path program 1 times [2025-02-06 10:33:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-02-06 10:33:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:33:26,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:33:26,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:26,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:26,415 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:33:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:26,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-02-06 10:33:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589323574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:26,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097652294] [2025-02-06 10:33:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:26,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:26,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:26,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:26,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:26,419 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:26,584 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2025-02-06 10:33:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:33:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:26,585 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:33:26,586 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 10:33:26,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:26,586 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:26,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 307 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 10:33:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-06 10:33:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5486725663716814) internal successors, (175), 156 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2025-02-06 10:33:26,604 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 12 [2025-02-06 10:33:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:26,604 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2025-02-06 10:33:26,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2025-02-06 10:33:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:33:26,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:26,607 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:33:26,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:33:26,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 463027986, now seen corresponding path program 1 times [2025-02-06 10:33:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324688093] [2025-02-06 10:33:26,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:26,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:33:26,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:33:26,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:26,814 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:33:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324688093] [2025-02-06 10:33:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324688093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:33:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360294191] [2025-02-06 10:33:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:26,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:33:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:26,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:33:26,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:26,816 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:33:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:27,056 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2025-02-06 10:33:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:33:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:33:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:27,058 INFO L225 Difference]: With dead ends: 157 [2025-02-06 10:33:27,058 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 10:33:27,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:33:27,058 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 122 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:27,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 220 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 10:33:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 10:33:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 155 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2025-02-06 10:33:27,062 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 16 [2025-02-06 10:33:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:27,063 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2025-02-06 10:33:27,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:33:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2025-02-06 10:33:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:33:27,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:27,063 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:33:27,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:33:27,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:27,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 463027987, now seen corresponding path program 1 times [2025-02-06 10:33:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-02-06 10:33:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:27,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:33:27,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:33:27,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:27,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:27,366 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:33:27,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:27,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-02-06 10:33:27,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:27,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:27,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:33:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395695518] [2025-02-06 10:33:27,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:27,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:33:27,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:27,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:33:27,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:27,367 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:33:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:27,782 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2025-02-06 10:33:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:33:27,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:33:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:27,783 INFO L225 Difference]: With dead ends: 153 [2025-02-06 10:33:27,783 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 10:33:27,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:33:27,784 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 125 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:27,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 322 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 10:33:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2025-02-06 10:33:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.5238095238095237) internal successors, (160), 142 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2025-02-06 10:33:27,792 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 16 [2025-02-06 10:33:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:27,793 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2025-02-06 10:33:27,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:33:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2025-02-06 10:33:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:33:27,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:27,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:27,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:33:27,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:27,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash -924592000, now seen corresponding path program 1 times [2025-02-06 10:33:27,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:27,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253790025] [2025-02-06 10:33:27,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:27,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:33:27,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:33:27,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:27,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:27,816 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:33:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253790025] [2025-02-06 10:33:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253790025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:27,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201597635] [2025-02-06 10:33:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:27,817 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:27,825 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2025-02-06 10:33:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:33:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:27,825 INFO L225 Difference]: With dead ends: 146 [2025-02-06 10:33:27,826 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 10:33:27,826 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:33:27,826 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:27,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 10:33:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-02-06 10:33:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.514018691588785) internal successors, (162), 144 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2025-02-06 10:33:27,829 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 19 [2025-02-06 10:33:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:27,829 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2025-02-06 10:33:27,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2025-02-06 10:33:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:33:27,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:27,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:27,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:33:27,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:27,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -907404515, now seen corresponding path program 1 times [2025-02-06 10:33:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:27,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-02-06 10:33:27,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:27,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:27,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:33:27,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:33:27,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:27,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:27,860 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:33:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-02-06 10:33:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865810003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601722686] [2025-02-06 10:33:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:27,862 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:27,959 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2025-02-06 10:33:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:33:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:27,960 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:33:27,960 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 10:33:27,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:33:27,960 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 125 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:27,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 198 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 10:33:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2025-02-06 10:33:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.485981308411215) internal successors, (159), 144 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2025-02-06 10:33:27,964 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 19 [2025-02-06 10:33:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:27,964 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2025-02-06 10:33:27,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2025-02-06 10:33:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:33:27,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:27,964 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:27,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:33:27,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:27,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1987405025, now seen corresponding path program 1 times [2025-02-06 10:33:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163583479] [2025-02-06 10:33:27,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:33:27,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:33:27,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:27,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163583479] [2025-02-06 10:33:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163583479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:28,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:28,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:33:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170087145] [2025-02-06 10:33:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:28,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:28,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:28,108 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:28,251 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2025-02-06 10:33:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:33:28,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:33:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:28,252 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:33:28,252 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:33:28,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:28,252 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 27 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:28,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 451 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:33:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2025-02-06 10:33:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.4649122807017543) internal successors, (167), 151 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2025-02-06 10:33:28,256 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 21 [2025-02-06 10:33:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:28,256 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2025-02-06 10:33:28,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2025-02-06 10:33:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:33:28,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:28,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:28,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:33:28,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:28,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1043095219, now seen corresponding path program 1 times [2025-02-06 10:33:28,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:28,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892372393] [2025-02-06 10:33:28,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:28,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:28,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:33:28,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:33:28,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:28,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:28,361 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:33:28,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892372393] [2025-02-06 10:33:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892372393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:28,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:33:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253107391] [2025-02-06 10:33:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:28,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:28,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:28,363 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:28,504 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2025-02-06 10:33:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:33:28,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 10:33:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:28,505 INFO L225 Difference]: With dead ends: 169 [2025-02-06 10:33:28,505 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 10:33:28,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:28,506 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 12 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:28,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 318 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 10:33:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2025-02-06 10:33:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 163 states have internal predecessors, (182), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2025-02-06 10:33:28,509 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 22 [2025-02-06 10:33:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:28,509 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2025-02-06 10:33:28,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2025-02-06 10:33:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:33:28,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:28,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:28,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:33:28,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:28,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1693801755, now seen corresponding path program 1 times [2025-02-06 10:33:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:28,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-02-06 10:33:28,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:28,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:33:28,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:33:28,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:28,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:28,582 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:33:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-02-06 10:33:28,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696342524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:28,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:28,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372185404] [2025-02-06 10:33:28,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:28,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:28,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:28,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:28,583 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 5 states, 4 states have (on average 6.0) 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:33:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:28,713 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2025-02-06 10:33:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:28,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) 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:33:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:28,714 INFO L225 Difference]: With dead ends: 164 [2025-02-06 10:33:28,714 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 10:33:28,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:28,714 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:28,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 10:33:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-06 10:33:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 162 states have internal predecessors, (180), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2025-02-06 10:33:28,717 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 24 [2025-02-06 10:33:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:28,717 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2025-02-06 10:33:28,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) 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:33:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2025-02-06 10:33:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:33:28,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:28,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:28,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:33:28,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1693801754, now seen corresponding path program 1 times [2025-02-06 10:33:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:28,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-02-06 10:33:28,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:28,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:33:28,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:33:28,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:28,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:28,804 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:33:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-02-06 10:33:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136721804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-02-06 10:33:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:28,805 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand has 5 states, 4 states have (on average 6.0) 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:33:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:28,926 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2025-02-06 10:33:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) 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:33:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:28,927 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:33:28,927 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:33:28,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:28,928 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:28,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 294 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:33:28,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-06 10:33:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 161 states have internal predecessors, (178), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2025-02-06 10:33:28,930 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 24 [2025-02-06 10:33:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2025-02-06 10:33:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) 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:33:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2025-02-06 10:33:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:33:28,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:28,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:28,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:33:28,932 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:28,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -40101601, now seen corresponding path program 1 times [2025-02-06 10:33:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:28,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-02-06 10:33:28,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:28,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:33:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:33:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:29,050 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:33:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-02-06 10:33:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83327381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:29,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:33:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240889597] [2025-02-06 10:33:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:33:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:29,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:33:29,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:29,052 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:29,298 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2025-02-06 10:33:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:33:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 10:33:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:29,299 INFO L225 Difference]: With dead ends: 162 [2025-02-06 10:33:29,299 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 10:33:29,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:33:29,299 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 100 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:29,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 250 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 10:33:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-06 10:33:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 160 states have internal predecessors, (177), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2025-02-06 10:33:29,303 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 28 [2025-02-06 10:33:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:29,303 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2025-02-06 10:33:29,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2025-02-06 10:33:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:33:29,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:29,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:33:29,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -40101600, now seen corresponding path program 1 times [2025-02-06 10:33:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028621125] [2025-02-06 10:33:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:29,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:33:29,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:33:29,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:29,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:29,501 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:33:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028621125] [2025-02-06 10:33:29,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028621125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:29,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:29,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:33:29,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-02-06 10:33:29,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:29,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:33:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:29,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:33:29,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:29,503 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:29,786 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2025-02-06 10:33:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:33:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 10:33:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:29,787 INFO L225 Difference]: With dead ends: 160 [2025-02-06 10:33:29,787 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:33:29,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:33:29,787 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:29,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 268 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:33:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-06 10:33:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 158 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 178 transitions. [2025-02-06 10:33:29,790 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 178 transitions. Word has length 28 [2025-02-06 10:33:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 178 transitions. [2025-02-06 10:33:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2025-02-06 10:33:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:33:29,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:29,791 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] [2025-02-06 10:33:29,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:33:29,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:29,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1750133212, now seen corresponding path program 1 times [2025-02-06 10:33:29,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:29,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475987634] [2025-02-06 10:33:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:29,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:29,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:29,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:29,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:30,054 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:33:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475987634] [2025-02-06 10:33:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475987634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121018918] [2025-02-06 10:33:30,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:30,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:30,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:30,057 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:33:30,058 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:33:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:30,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:33:30,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:30,190 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:33:30,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33:30,315 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:33:30,348 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:33:30,438 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:30,439 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 34 treesize of output 33 [2025-02-06 10:33:30,558 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:33:30,559 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 33 treesize of output 24 [2025-02-06 10:33:30,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:30,578 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 34 treesize of output 33 [2025-02-06 10:33:30,706 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 25 treesize of output 13 [2025-02-06 10:33:30,710 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:33:30,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:31,049 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 10:33:31,049 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 29 treesize of output 28 [2025-02-06 10:33:31,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_504)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|)))) is different from false [2025-02-06 10:33:31,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:31,139 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 36 treesize of output 29 [2025-02-06 10:33:31,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:31,151 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 236 treesize of output 211 [2025-02-06 10:33:31,162 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 155 treesize of output 147 [2025-02-06 10:33:31,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:31,174 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 147 treesize of output 143 [2025-02-06 10:33:31,535 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:33:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121018918] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:31,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2025-02-06 10:33:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164923263] [2025-02-06 10:33:31,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:33:31,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:31,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:33:31,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=931, Unknown=11, NotChecked=62, Total=1122 [2025-02-06 10:33:31,538 INFO L87 Difference]: Start difference. First operand 160 states and 178 transitions. Second operand has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 34 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:33:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:32,632 INFO L93 Difference]: Finished difference Result 235 states and 264 transitions. [2025-02-06 10:33:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:33:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 34 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 32 [2025-02-06 10:33:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:32,635 INFO L225 Difference]: With dead ends: 235 [2025-02-06 10:33:32,635 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 10:33:32,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=1470, Unknown=11, NotChecked=80, Total=1806 [2025-02-06 10:33:32,636 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 659 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:32,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 889 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1695 Invalid, 0 Unknown, 218 Unchecked, 0.9s Time] [2025-02-06 10:33:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 10:33:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 184. [2025-02-06 10:33:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 182 states have internal predecessors, (203), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2025-02-06 10:33:32,639 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 32 [2025-02-06 10:33:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:32,640 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2025-02-06 10:33:32,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 34 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:33:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2025-02-06 10:33:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:33:32,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:32,641 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] [2025-02-06 10:33:32,650 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:33:32,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 10:33:32,845 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:32,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1750133211, now seen corresponding path program 1 times [2025-02-06 10:33:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230915655] [2025-02-06 10:33:32,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:32,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:32,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:32,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:32,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:33,191 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:33:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230915655] [2025-02-06 10:33:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230915655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148006725] [2025-02-06 10:33:33,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:33,193 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:33:33,195 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:33:33,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:33,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:33,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 10:33:33,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:33,277 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:33:33,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33:33,329 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:33:33,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-02-06 10:33:33,368 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:33:33,373 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:33:33,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:33,451 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 55 treesize of output 37 [2025-02-06 10:33:33,456 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 24 treesize of output 11 [2025-02-06 10:33:33,598 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:33:33,598 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:33:33,613 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-02-06 10:33:33,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-02-06 10:33:33,616 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 7 treesize of output 3 [2025-02-06 10:33:33,653 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:33,653 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 50 treesize of output 45 [2025-02-06 10:33:33,657 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 24 treesize of output 11 [2025-02-06 10:33:33,781 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 25 treesize of output 13 [2025-02-06 10:33:33,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 10:33:33,790 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:33:33,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:33,996 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_607 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (< 0 (+ 1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) is different from false [2025-02-06 10:33:34,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:34,466 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 53 treesize of output 54 [2025-02-06 10:33:34,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:34,479 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 166 treesize of output 161 [2025-02-06 10:33:34,485 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 57 treesize of output 55 [2025-02-06 10:33:34,488 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 86 treesize of output 80 [2025-02-06 10:33:34,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:34,568 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 118 treesize of output 119 [2025-02-06 10:33:34,570 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:33:34,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:34,574 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 29 treesize of output 30 [2025-02-06 10:33:34,577 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:33:34,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:34,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:34,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 10:33:34,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:33:34,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:34,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:34,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-06 10:33:34,772 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:33:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148006725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:34,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14] total 37 [2025-02-06 10:33:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969483769] [2025-02-06 10:33:34,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:34,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:33:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:34,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:33:34,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1151, Unknown=27, NotChecked=70, Total=1406 [2025-02-06 10:33:34,775 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 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:33:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:36,451 INFO L93 Difference]: Finished difference Result 272 states and 309 transitions. [2025-02-06 10:33:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:33:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:33:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:36,453 INFO L225 Difference]: With dead ends: 272 [2025-02-06 10:33:36,453 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 10:33:36,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=472, Invalid=2696, Unknown=28, NotChecked=110, Total=3306 [2025-02-06 10:33:36,454 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 883 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1097 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1561 Invalid, 0 Unknown, 243 Unchecked, 1.1s Time] [2025-02-06 10:33:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 10:33:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 185. [2025-02-06 10:33:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 157 states have (on average 1.3312101910828025) internal successors, (209), 183 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2025-02-06 10:33:36,458 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 32 [2025-02-06 10:33:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:36,458 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2025-02-06 10:33:36,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 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:33:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2025-02-06 10:33:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:33:36,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:36,459 INFO L218 NwaCegarLoop]: trace histogram [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:33:36,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:33:36,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 10:33:36,663 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:36,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2081090103, now seen corresponding path program 1 times [2025-02-06 10:33:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:36,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-02-06 10:33:36,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:36,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:33:36,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:33:36,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:36,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-02-06 10:33:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365832504] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130919476] [2025-02-06 10:33:37,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:37,080 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:33:37,085 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:33:37,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:33:37,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:33:37,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:37,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:37,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:33:37,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:37,186 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:33:37,237 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33:37,238 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:33:37,268 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:33:37,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:37,324 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 25 treesize of output 26 [2025-02-06 10:33:37,386 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:33:37,386 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 24 treesize of output 17 [2025-02-06 10:33:37,420 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:37,420 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 34 treesize of output 33 [2025-02-06 10:33:37,531 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 33 treesize of output 17 [2025-02-06 10:33:37,545 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 25 treesize of output 13 [2025-02-06 10:33:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:37,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:37,674 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-02-06 10:33:37,675 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 19 treesize of output 18 [2025-02-06 10:33:37,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_716 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_718 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_718) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) .cse1))) (< |v_ULTIMATE.start_main_~x~0#1.offset_92| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_92|))) is different from false [2025-02-06 10:33:37,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:37,861 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 51 treesize of output 36 [2025-02-06 10:33:37,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:37,873 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 330 treesize of output 265 [2025-02-06 10:33:37,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:37,883 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 64 treesize of output 59 [2025-02-06 10:33:37,886 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 74 treesize of output 68 [2025-02-06 10:33:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130919476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:38,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 33 [2025-02-06 10:33:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079133870] [2025-02-06 10:33:38,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:33:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:33:38,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=939, Unknown=16, NotChecked=62, Total=1122 [2025-02-06 10:33:38,113 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand has 34 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 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:33:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:38,853 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2025-02-06 10:33:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:33:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 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:33:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:38,855 INFO L225 Difference]: With dead ends: 251 [2025-02-06 10:33:38,855 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 10:33:38,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=1345, Unknown=16, NotChecked=76, Total=1640 [2025-02-06 10:33:38,856 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 485 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:38,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 970 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1324 Invalid, 0 Unknown, 188 Unchecked, 0.6s Time] [2025-02-06 10:33:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 10:33:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 193. [2025-02-06 10:33:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 191 states have internal predecessors, (219), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 222 transitions. [2025-02-06 10:33:38,861 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 222 transitions. Word has length 33 [2025-02-06 10:33:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 222 transitions. [2025-02-06 10:33:38,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 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:33:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 222 transitions. [2025-02-06 10:33:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:33:38,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:38,862 INFO L218 NwaCegarLoop]: trace histogram [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:33:38,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:33:39,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:39,065 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:39,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2081090102, now seen corresponding path program 1 times [2025-02-06 10:33:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508945376] [2025-02-06 10:33:39,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:39,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:33:39,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:33:39,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:39,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508945376] [2025-02-06 10:33:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508945376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:39,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309641721] [2025-02-06 10:33:39,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:39,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:39,399 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:33:39,404 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:33:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:33:39,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:33:39,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:39,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:39,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:33:39,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:39,497 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:33:39,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33:39,552 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:33:39,575 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:33:39,580 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:33:39,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:39,647 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 46 treesize of output 32 [2025-02-06 10:33:39,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 24 treesize of output 11 [2025-02-06 10:33:39,798 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-02-06 10:33:39,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 29 [2025-02-06 10:33:39,803 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 7 treesize of output 3 [2025-02-06 10:33:39,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:39,808 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 16 treesize of output 11 [2025-02-06 10:33:39,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:39,844 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 50 treesize of output 45 [2025-02-06 10:33:39,847 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 24 treesize of output 11 [2025-02-06 10:33:39,985 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:33:39,990 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 33 treesize of output 17 [2025-02-06 10:33:40,009 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 25 treesize of output 13 [2025-02-06 10:33:40,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 10:33:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:40,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:40,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:40,235 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 56 treesize of output 60 [2025-02-06 10:33:40,381 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_833 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_2) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_2) 1) (< v_prenex_2 0))) (forall ((v_ArrVal_834 (Array Int Int)) (v_prenex_2 Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_2) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_2)) (< v_prenex_2 0)))) is different from false [2025-02-06 10:33:40,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:40,986 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 51 treesize of output 52 [2025-02-06 10:33:40,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:40,997 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 104 treesize of output 103 [2025-02-06 10:33:41,004 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 88 treesize of output 82 [2025-02-06 10:33:41,011 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 53 treesize of output 51 [2025-02-06 10:33:41,092 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:33:41,097 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:33:41,097 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 18 treesize of output 1 [2025-02-06 10:33:41,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:41,104 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 53 treesize of output 54 [2025-02-06 10:33:41,107 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:33:41,109 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:33:41,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:41,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:41,112 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 10:33:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309641721] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:41,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:41,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 37 [2025-02-06 10:33:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792030733] [2025-02-06 10:33:41,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:41,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:33:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:41,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:33:41,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1190, Unknown=30, NotChecked=70, Total=1406 [2025-02-06 10:33:41,306 INFO L87 Difference]: Start difference. First operand 193 states and 222 transitions. Second operand has 38 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 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:33:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:43,021 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2025-02-06 10:33:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:33:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 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:33:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:43,023 INFO L225 Difference]: With dead ends: 253 [2025-02-06 10:33:43,023 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 10:33:43,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=268, Invalid=1951, Unknown=41, NotChecked=92, Total=2352 [2025-02-06 10:33:43,025 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 462 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 51 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:43,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1345 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1978 Invalid, 19 Unknown, 190 Unchecked, 1.3s Time] [2025-02-06 10:33:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 10:33:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2025-02-06 10:33:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.3212121212121213) internal successors, (218), 191 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2025-02-06 10:33:43,031 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 33 [2025-02-06 10:33:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2025-02-06 10:33:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 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:33:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2025-02-06 10:33:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:33:43,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:43,032 INFO L218 NwaCegarLoop]: trace histogram [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:33:43,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:33:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:43,235 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-02-06 10:33:43,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1403610732, now seen corresponding path program 1 times [2025-02-06 10:33:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-02-06 10:33:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:33:43,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:33:43,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:43,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-02-06 10:33:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061365981] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485742565] [2025-02-06 10:33:43,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:43,574 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:33:43,575 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:33:43,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:33:43,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:33:43,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:43,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:33:43,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:43,799 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:33:43,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:33:43,838 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:33:43,914 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:43,914 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 34 treesize of output 33 [2025-02-06 10:33:44,027 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:33:44,027 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 33 treesize of output 24 [2025-02-06 10:33:44,045 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:44,045 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 34 treesize of output 33 [2025-02-06 10:33:44,122 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 25 treesize of output 13 [2025-02-06 10:33:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:44,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:44,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:44,508 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 38 treesize of output 31 [2025-02-06 10:33:44,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:44,523 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 144 treesize of output 131 [2025-02-06 10:33:44,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:44,532 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 80 treesize of output 78 [2025-02-06 10:33:44,535 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 70 treesize of output 66 [2025-02-06 10:34:05,626 WARN L286 SmtUtils]: Spent 18.28s on a formula simplification that was a NOOP. DAG size: 2889 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-06 10:34:05,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:05,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 38 select indices, 38 select index equivalence classes, 0 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 703 case distinctions, treesize of input 580 treesize of output 6118