./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:53:52,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:53:53,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:53:53,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:53:53,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:53:53,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:53:53,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:53:53,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:53:53,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:53:53,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:53:53,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:53:53,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:53:53,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:53:53,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:53:53,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:53:53,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:53:53,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:53:53,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:53:53,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:53:53,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:53:53,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:53:53,054 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/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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2025-03-04 07:53:53,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:53:53,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:53:53,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:53:53,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:53:53,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:53:53,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2025-03-04 07:53:54,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fa5d47e/cc2dbefdfc0c41bb94e656578aeafb8e/FLAGdd77dd407 [2025-03-04 07:53:54,789 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:53:54,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2025-03-04 07:53:54,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fa5d47e/cc2dbefdfc0c41bb94e656578aeafb8e/FLAGdd77dd407 [2025-03-04 07:53:54,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fa5d47e/cc2dbefdfc0c41bb94e656578aeafb8e [2025-03-04 07:53:54,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:53:54,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:53:54,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:53:54,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:53:54,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:53:54,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:53:54" (1/1) ... [2025-03-04 07:53:54,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a48582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:54, skipping insertion in model container [2025-03-04 07:53:54,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:53:54" (1/1) ... [2025-03-04 07:53:54,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:53:55,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:53:55,032 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:53:55,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:53:55,078 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:53:55,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55 WrapperNode [2025-03-04 07:53:55,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:53:55,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:53:55,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:53:55,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:53:55,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,115 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2025-03-04 07:53:55,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:53:55,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:53:55,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:53:55,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:53:55,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,135 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-03-04 07:53:55,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:53:55,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:53:55,149 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:53:55,149 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:53:55,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (1/1) ... [2025-03-04 07:53:55,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:53:55,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:55,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:53:55,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:53:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:53:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:53:55,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:53:55,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:53:55,693 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-03-04 07:53:55,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:53:55,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:53:55,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:53:55,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:53:55 BoogieIcfgContainer [2025-03-04 07:53:55,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:53:55,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:53:55,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:53:55,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:53:55,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:53:54" (1/3) ... [2025-03-04 07:53:55,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7af45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:53:55, skipping insertion in model container [2025-03-04 07:53:55,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:53:55" (2/3) ... [2025-03-04 07:53:55,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7af45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:53:55, skipping insertion in model container [2025-03-04 07:53:55,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:53:55" (3/3) ... [2025-03-04 07:53:55,725 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2025-03-04 07:53:55,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:53:55,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-sorted-2.i that has 2 procedures, 169 locations, 1 initial locations, 13 loop locations, and 65 error locations. [2025-03-04 07:53:55,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:53:55,775 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;@39a14f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:53:55,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-04 07:53:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 95 states have (on average 2.0842105263157893) internal successors, (198), 160 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:53:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:53:55,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:55,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:53:55,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 234315, now seen corresponding path program 1 times [2025-03-04 07:53:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352926755] [2025-03-04 07:53:55,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:55,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:53:55,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:53:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352926755] [2025-03-04 07:53:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352926755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:55,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:53:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318797195] [2025-03-04 07:53:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:53:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:55,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:53:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:55,951 INFO L87 Difference]: Start difference. First operand has 169 states, 95 states have (on average 2.0842105263157893) internal successors, (198), 160 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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-03-04 07:53:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:56,085 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2025-03-04 07:53:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:53:56,086 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-03-04 07:53:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:56,091 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:53:56,091 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:53:56,093 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-03-04 07:53:56,095 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 144 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:56,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:53:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-04 07:53:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 86 states have (on average 1.930232558139535) internal successors, (166), 154 states have internal predecessors, (166), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2025-03-04 07:53:56,128 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 3 [2025-03-04 07:53:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:56,129 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2025-03-04 07:53:56,129 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-03-04 07:53:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2025-03-04 07:53:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:53:56,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:56,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:53:56,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:53:56,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:56,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash 234316, now seen corresponding path program 1 times [2025-03-04 07:53:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:56,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346854040] [2025-03-04 07:53:56,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:56,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:53:56,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:53:56,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:56,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346854040] [2025-03-04 07:53:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346854040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:53:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886897732] [2025-03-04 07:53:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:56,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:53:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:56,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:53:56,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:56,209 INFO L87 Difference]: Start difference. First operand 156 states and 173 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-03-04 07:53:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:56,302 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2025-03-04 07:53:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:53:56,303 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-03-04 07:53:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:56,304 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:53:56,304 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:53:56,304 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-03-04 07:53:56,304 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 144 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:56,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:53:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 07:53:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 86 states have (on average 1.9069767441860466) internal successors, (164), 152 states have internal predecessors, (164), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2025-03-04 07:53:56,310 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 3 [2025-03-04 07:53:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2025-03-04 07:53:56,312 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-03-04 07:53:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2025-03-04 07:53:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:53:56,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:56,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:56,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:53:56,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:56,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash -338155050, now seen corresponding path program 1 times [2025-03-04 07:53:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636629235] [2025-03-04 07:53:56,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:53:56,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:53:56,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:56,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636629235] [2025-03-04 07:53:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636629235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:53:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649199338] [2025-03-04 07:53:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:53:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:56,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:53:56,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:53:56,461 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:56,632 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2025-03-04 07:53:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:53:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:53:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:56,633 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:53:56,635 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:53:56,635 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-03-04 07:53:56,635 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 224 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:56,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 91 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:53:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2025-03-04 07:53:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.72) internal successors, (172), 149 states have internal predecessors, (172), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2025-03-04 07:53:56,643 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 8 [2025-03-04 07:53:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:56,643 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2025-03-04 07:53:56,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2025-03-04 07:53:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:53:56,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:56,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:56,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:53:56,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:56,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -338155049, now seen corresponding path program 1 times [2025-03-04 07:53:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309287921] [2025-03-04 07:53:56,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:56,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:53:56,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:53:56,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:56,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:56,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-03-04 07:53:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309287921] [2025-03-04 07:53:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309287921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:56,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455549897] [2025-03-04 07:53:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:56,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:53:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:56,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:53:56,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:53:56,862 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:57,102 INFO L93 Difference]: Finished difference Result 214 states and 251 transitions. [2025-03-04 07:53:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:53:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:53:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:57,104 INFO L225 Difference]: With dead ends: 214 [2025-03-04 07:53:57,104 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 07:53:57,105 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-03-04 07:53:57,105 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 469 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:57,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 186 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 07:53:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2025-03-04 07:53:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.5973154362416107) internal successors, (238), 198 states have internal predecessors, (238), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2025-03-04 07:53:57,112 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 8 [2025-03-04 07:53:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:57,112 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2025-03-04 07:53:57,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2025-03-04 07:53:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:53:57,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:57,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:57,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:53:57,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1965737866, now seen corresponding path program 1 times [2025-03-04 07:53:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589030316] [2025-03-04 07:53:57,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:57,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:53:57,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:53:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589030316] [2025-03-04 07:53:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589030316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:57,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:53:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859072404] [2025-03-04 07:53:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:57,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:53:57,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:57,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:53:57,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:57,144 INFO L87 Difference]: Start difference. First operand 200 states and 245 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-04 07:53:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:57,165 INFO L93 Difference]: Finished difference Result 238 states and 286 transitions. [2025-03-04 07:53:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:53:57,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-03-04 07:53:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:57,168 INFO L225 Difference]: With dead ends: 238 [2025-03-04 07:53:57,168 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 07:53:57,168 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-03-04 07:53:57,168 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 48 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:57,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 314 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:53:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 07:53:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 210. [2025-03-04 07:53:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 159 states have (on average 1.5849056603773586) internal successors, (252), 208 states have internal predecessors, (252), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 259 transitions. [2025-03-04 07:53:57,181 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 259 transitions. Word has length 12 [2025-03-04 07:53:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:57,181 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 259 transitions. [2025-03-04 07:53:57,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-04 07:53:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2025-03-04 07:53:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:53:57,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:57,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:53:57,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1918010736, now seen corresponding path program 1 times [2025-03-04 07:53:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284318659] [2025-03-04 07:53:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:53:57,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:53:57,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:57,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284318659] [2025-03-04 07:53:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284318659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713028553] [2025-03-04 07:53:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:57,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:53:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:57,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:53:57,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:53:57,293 INFO L87 Difference]: Start difference. First operand 210 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-03-04 07:53:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:57,509 INFO L93 Difference]: Finished difference Result 213 states and 263 transitions. [2025-03-04 07:53:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:53:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-03-04 07:53:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:57,511 INFO L225 Difference]: With dead ends: 213 [2025-03-04 07:53:57,511 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 07:53:57,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:53:57,512 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:57,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 353 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 07:53:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2025-03-04 07:53:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 159 states have (on average 1.5723270440251573) internal successors, (250), 207 states have internal predecessors, (250), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2025-03-04 07:53:57,524 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 12 [2025-03-04 07:53:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:57,524 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2025-03-04 07:53:57,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-03-04 07:53:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2025-03-04 07:53:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:53:57,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:57,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:53:57,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1918010735, now seen corresponding path program 1 times [2025-03-04 07:53:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382473567] [2025-03-04 07:53:57,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:57,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:53:57,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:53:57,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:57,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:57,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382473567] [2025-03-04 07:53:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382473567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:53:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137348182] [2025-03-04 07:53:57,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:57,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:53:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:57,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:53:57,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:53:57,712 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-03-04 07:53:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:57,898 INFO L93 Difference]: Finished difference Result 204 states and 249 transitions. [2025-03-04 07:53:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:53:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-03-04 07:53:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:57,900 INFO L225 Difference]: With dead ends: 204 [2025-03-04 07:53:57,900 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 07:53:57,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:53:57,901 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 12 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:57,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 458 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 07:53:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2025-03-04 07:53:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 154 states have (on average 1.5389610389610389) internal successors, (237), 197 states have internal predecessors, (237), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2025-03-04 07:53:57,906 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 12 [2025-03-04 07:53:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:57,906 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2025-03-04 07:53:57,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-03-04 07:53:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2025-03-04 07:53:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:53:57,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:57,907 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] [2025-03-04 07:53:57,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:53:57,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:57,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1419629656, now seen corresponding path program 1 times [2025-03-04 07:53:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787961217] [2025-03-04 07:53:57,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:57,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:53:57,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:53:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:53:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787961217] [2025-03-04 07:53:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787961217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:53:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676018271] [2025-03-04 07:53:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:53:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:57,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:53:57,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:53:57,966 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-03-04 07:53:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:58,063 INFO L93 Difference]: Finished difference Result 216 states and 250 transitions. [2025-03-04 07:53:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:53:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2025-03-04 07:53:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:58,064 INFO L225 Difference]: With dead ends: 216 [2025-03-04 07:53:58,064 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 07:53:58,064 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-03-04 07:53:58,064 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 249 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:58,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 204 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:53:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 07:53:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2025-03-04 07:53:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 196 states have internal predecessors, (234), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2025-03-04 07:53:58,071 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 23 [2025-03-04 07:53:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:58,072 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2025-03-04 07:53:58,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-03-04 07:53:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2025-03-04 07:53:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:53:58,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:58,075 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] [2025-03-04 07:53:58,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:53:58,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:53:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 629614424, now seen corresponding path program 1 times [2025-03-04 07:53:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152663033] [2025-03-04 07:53:58,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:53:58,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:53:58,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:58,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:58,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152663033] [2025-03-04 07:53:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152663033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235800509] [2025-03-04 07:53:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:58,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:58,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:58,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:53:58,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:53:58,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:53:58,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:58,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:58,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:53:58,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:58,540 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-03-04 07:53:58,613 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:58,613 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-03-04 07:53:58,652 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-03-04 07:53:58,738 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:58,739 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-03-04 07:53:58,799 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:53:58,799 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-03-04 07:53:58,926 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-03-04 07:53:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:58,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:59,130 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-03-04 07:53:59,131 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-03-04 07:53:59,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:59,290 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 19 [2025-03-04 07:53:59,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:59,298 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 30 treesize of output 33 [2025-03-04 07:53:59,305 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 9 treesize of output 7 [2025-03-04 07:53:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235800509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:59,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:59,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-03-04 07:53:59,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844094195] [2025-03-04 07:53:59,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:59,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:53:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:59,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:53:59,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=831, Unknown=6, NotChecked=0, Total=930 [2025-03-04 07:53:59,549 INFO L87 Difference]: Start difference. First operand 198 states and 240 transitions. Second operand has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 31 states have internal predecessors, (74), 0 states have call successors, (0), 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-03-04 07:54:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:00,528 INFO L93 Difference]: Finished difference Result 303 states and 351 transitions. [2025-03-04 07:54:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:54:00,528 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 31 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 07:54:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:00,529 INFO L225 Difference]: With dead ends: 303 [2025-03-04 07:54:00,529 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 07:54:00,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1330, Unknown=6, NotChecked=0, Total=1560 [2025-03-04 07:54:00,530 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1314 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:00,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1262 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:54:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 07:54:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 220. [2025-03-04 07:54:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 218 states have internal predecessors, (261), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2025-03-04 07:54:00,539 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 27 [2025-03-04 07:54:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2025-03-04 07:54:00,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 31 states have internal predecessors, (74), 0 states have call successors, (0), 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-03-04 07:54:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2025-03-04 07:54:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:54:00,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:00,540 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] [2025-03-04 07:54:00,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:54:00,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:00,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:54:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash 629614425, now seen corresponding path program 1 times [2025-03-04 07:54:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348385580] [2025-03-04 07:54:00,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:00,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:54:00,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:54:00,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:00,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348385580] [2025-03-04 07:54:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348385580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:54:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32509275] [2025-03-04 07:54:01,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:01,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:01,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:01,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:54:01,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:54:01,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:54:01,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:54:01,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:01,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:01,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 07:54:01,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:01,269 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-03-04 07:54:01,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:54:01,363 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 07:54:01,363 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 19 treesize of output 18 [2025-03-04 07:54:01,381 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 07:54:01,382 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 19 treesize of output 22 [2025-03-04 07:54:01,495 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:54:01,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:54:01,510 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:54:01,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 07:54:01,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:54:01,839 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 [2025-03-04 07:54:01,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:54:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:01,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:54:02,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:54:02,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 199 [2025-03-04 07:55:09,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:55:09,608 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 46671 treesize of output 44615 [2025-03-04 07:55:10,107 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 1274 treesize of output 1242 [2025-03-04 07:55:12,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,324 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 07:55:12,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,337 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,350 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,358 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,358 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,362 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,363 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,365 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 07:55:12,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,371 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,376 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,385 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,386 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,388 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 07:55:12,391 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,392 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,395 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 07:55:12,398 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,399 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,401 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 07:55:12,406 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,407 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,409 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 07:55:12,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:12,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:55:12,421 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:55:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32509275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:55:28,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:55:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 37 [2025-03-04 07:55:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12002671] [2025-03-04 07:55:28,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:55:28,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:55:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:28,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:55:28,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1251, Unknown=12, NotChecked=0, Total=1406 [2025-03-04 07:55:28,480 INFO L87 Difference]: Start difference. First operand 220 states and 267 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)