./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.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/dll-rb-cnstr_1-1.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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:05,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:05,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:52:05,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:05,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:05,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:05,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:05,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:05,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:05,777 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:05,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:05,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:05,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:05,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:05,778 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:05,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:05,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:05,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:05,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:05,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:05,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:05,781 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2025-03-04 07:52:06,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:06,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:06,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:06,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:06,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:06,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2025-03-04 07:52:07,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f534f8e/b9f2af12f1574c9aa4257cd5733ae5af/FLAG9688751d2 [2025-03-04 07:52:07,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:07,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2025-03-04 07:52:07,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f534f8e/b9f2af12f1574c9aa4257cd5733ae5af/FLAG9688751d2 [2025-03-04 07:52:07,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f534f8e/b9f2af12f1574c9aa4257cd5733ae5af [2025-03-04 07:52:07,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:07,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:07,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:07,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:07,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:07,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f13cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07, skipping insertion in model container [2025-03-04 07:52:07,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:07,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:07,781 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:07,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:07,844 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:07,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07 WrapperNode [2025-03-04 07:52:07,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:07,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:07,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:07,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:07,850 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:52:07" (1/1) ... [2025-03-04 07:52:07,856 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:52:07" (1/1) ... [2025-03-04 07:52:07,875 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 146 [2025-03-04 07:52:07,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:07,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:07,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:07,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:07,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,896 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-03-04 07:52:07,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:07,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:07,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:07,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:07,907 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (1/1) ... [2025-03-04 07:52:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:07,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:07,932 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:52:07,937 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:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:52:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:52:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:08,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:08,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:08,355 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:08,358 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:08,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:08,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:08,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:08 BoogieIcfgContainer [2025-03-04 07:52:08,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:08,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:08,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:08,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:08,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:07" (1/3) ... [2025-03-04 07:52:08,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32431969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:08, skipping insertion in model container [2025-03-04 07:52:08,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:07" (2/3) ... [2025-03-04 07:52:08,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32431969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:08, skipping insertion in model container [2025-03-04 07:52:08,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:08" (3/3) ... [2025-03-04 07:52:08,381 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2025-03-04 07:52:08,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:08,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 2 procedures, 160 locations, 1 initial locations, 10 loop locations, and 65 error locations. [2025-03-04 07:52:08,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:08,431 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;@351b2ff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:08,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-04 07:52:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 86 states have (on average 2.0930232558139537) internal successors, (180), 151 states have internal predecessors, (180), 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:52:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:08,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:08,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:08,437 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:52:08,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash 216441, now seen corresponding path program 1 times [2025-03-04 07:52:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492487297] [2025-03-04 07:52:08,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:08,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:08,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:08,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:08,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:08,588 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:52:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492487297] [2025-03-04 07:52:08,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492487297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:08,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:08,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:08,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604068574] [2025-03-04 07:52:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:08,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:08,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:08,610 INFO L87 Difference]: Start difference. First operand has 160 states, 86 states have (on average 2.0930232558139537) internal successors, (180), 151 states have internal predecessors, (180), 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:52:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:08,755 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2025-03-04 07:52:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:08,757 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:52:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:08,762 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:52:08,762 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 07:52:08,763 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:52:08,766 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 117 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:08,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 99 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 07:52:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 07:52:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 79 states have (on average 1.8987341772151898) internal successors, (150), 142 states have internal predecessors, (150), 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:52:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-03-04 07:52:08,794 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 3 [2025-03-04 07:52:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:08,795 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-03-04 07:52:08,795 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:52:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-03-04 07:52:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:08,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:08,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:08,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:52:08,796 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:52:08,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 216442, now seen corresponding path program 1 times [2025-03-04 07:52:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:08,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371775680] [2025-03-04 07:52:08,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:08,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:08,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:08,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:08,857 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:52:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371775680] [2025-03-04 07:52:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371775680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975079569] [2025-03-04 07:52:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:08,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:08,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:08,859 INFO L87 Difference]: Start difference. First operand 144 states and 157 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:52:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:08,985 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-03-04 07:52:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:08,985 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:52:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:08,986 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:08,988 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:52:08,988 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:52:08,988 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:08,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 110 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:52:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 07:52:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.7906976744186047) internal successors, (154), 146 states have internal predecessors, (154), 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:52:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2025-03-04 07:52:08,995 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 3 [2025-03-04 07:52:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:08,996 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2025-03-04 07:52:08,997 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:52:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2025-03-04 07:52:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:52:08,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:08,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:08,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:52:08,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:08,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash -58855442, now seen corresponding path program 1 times [2025-03-04 07:52:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839759089] [2025-03-04 07:52:08,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:09,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:52:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:52:09,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:09,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:09,156 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:52:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839759089] [2025-03-04 07:52:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839759089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:09,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959862366] [2025-03-04 07:52:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:09,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:09,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:09,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:09,159 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:09,318 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2025-03-04 07:52:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:52:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:09,320 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:52:09,320 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:52:09,320 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:52:09,320 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:09,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 80 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:52:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 07:52:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.625) internal successors, (143), 133 states have internal predecessors, (143), 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:52:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2025-03-04 07:52:09,327 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 9 [2025-03-04 07:52:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:09,327 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2025-03-04 07:52:09,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2025-03-04 07:52:09,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:52:09,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:09,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:52:09,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash -58855441, now seen corresponding path program 1 times [2025-03-04 07:52:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25859182] [2025-03-04 07:52:09,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:09,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:52:09,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:52:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25859182] [2025-03-04 07:52:09,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25859182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:09,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:09,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510900535] [2025-03-04 07:52:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:09,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:09,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:09,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:09,520 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:09,756 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2025-03-04 07:52:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:52:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:09,758 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:09,758 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:52:09,758 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:52:09,759 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 130 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:09,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 163 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:52:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2025-03-04 07:52:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 99 states have (on average 1.5757575757575757) internal successors, (156), 143 states have internal predecessors, (156), 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:52:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2025-03-04 07:52:09,768 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 9 [2025-03-04 07:52:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2025-03-04 07:52:09,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2025-03-04 07:52:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:09,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:09,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:09,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:52:09,770 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:52:09,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:09,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1520514197, now seen corresponding path program 1 times [2025-03-04 07:52:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318211652] [2025-03-04 07:52:09,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:09,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:09,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:09,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:09,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:09,821 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:52:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318211652] [2025-03-04 07:52:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318211652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277095196] [2025-03-04 07:52:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:09,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:09,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:09,823 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:09,935 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2025-03-04 07:52:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2025-03-04 07:52:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:09,936 INFO L225 Difference]: With dead ends: 151 [2025-03-04 07:52:09,936 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 07:52:09,937 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:52:09,937 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 131 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:09,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 185 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 07:52:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2025-03-04 07:52:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 142 states have internal predecessors, (153), 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:52:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2025-03-04 07:52:09,941 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 13 [2025-03-04 07:52:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:09,941 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2025-03-04 07:52:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2025-03-04 07:52:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:09,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:09,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:09,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:52:09,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1015679912, now seen corresponding path program 1 times [2025-03-04 07:52:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434187811] [2025-03-04 07:52:09,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:09,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:09,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:09,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:10,019 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:52:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:10,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434187811] [2025-03-04 07:52:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434187811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:10,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476984475] [2025-03-04 07:52:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:10,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:10,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:10,021 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:10,166 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2025-03-04 07:52:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:10,167 INFO L225 Difference]: With dead ends: 143 [2025-03-04 07:52:10,167 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 07:52:10,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:10,168 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:10,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 342 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 07:52:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-04 07:52:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.5252525252525253) internal successors, (151), 141 states have internal predecessors, (151), 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:52:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2025-03-04 07:52:10,175 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 12 [2025-03-04 07:52:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:10,176 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2025-03-04 07:52:10,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2025-03-04 07:52:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:10,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:10,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:10,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:52:10,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:10,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1015679911, now seen corresponding path program 1 times [2025-03-04 07:52:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269544269] [2025-03-04 07:52:10,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:10,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:10,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:10,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:10,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:10,306 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:52:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:10,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269544269] [2025-03-04 07:52:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269544269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:10,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:10,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931717073] [2025-03-04 07:52:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:10,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:10,308 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:10,431 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2025-03-04 07:52:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:10,435 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:52:10,435 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 07:52:10,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:10,435 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:10,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 327 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 07:52:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-04 07:52:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.505050505050505) internal successors, (149), 140 states have internal predecessors, (149), 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:52:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2025-03-04 07:52:10,440 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 12 [2025-03-04 07:52:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:10,440 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2025-03-04 07:52:10,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2025-03-04 07:52:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:10,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:10,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:10,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:52:10,441 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:52:10,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:10,441 INFO L85 PathProgramCache]: Analyzing trace with hash -746365054, now seen corresponding path program 1 times [2025-03-04 07:52:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:10,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344454497] [2025-03-04 07:52:10,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:10,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:10,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:10,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:10,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:10,556 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:52:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344454497] [2025-03-04 07:52:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344454497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:10,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744625833] [2025-03-04 07:52:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:10,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:10,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:10,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:10,557 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:52:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:10,697 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2025-03-04 07:52:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:10,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16 [2025-03-04 07:52:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:10,698 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:52:10,698 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:52:10,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:10,699 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 204 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:10,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 330 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:52:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2025-03-04 07:52:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 145 states have internal predecessors, (154), 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:52:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2025-03-04 07:52:10,702 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 16 [2025-03-04 07:52:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2025-03-04 07:52:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:52:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2025-03-04 07:52:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:10,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:10,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:10,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:52:10,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1953565970, now seen corresponding path program 1 times [2025-03-04 07:52:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352307658] [2025-03-04 07:52:10,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:10,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:10,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:10,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:10,854 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:52:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352307658] [2025-03-04 07:52:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352307658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946308158] [2025-03-04 07:52:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:10,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:10,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:10,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:10,855 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:11,171 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2025-03-04 07:52:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:11,173 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:52:11,173 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:52:11,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:52:11,174 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:11,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 280 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:52:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 07:52:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 144 states have internal predecessors, (153), 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:52:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2025-03-04 07:52:11,177 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 16 [2025-03-04 07:52:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:11,178 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2025-03-04 07:52:11,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2025-03-04 07:52:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:11,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:11,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:52:11,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:11,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1953565971, now seen corresponding path program 1 times [2025-03-04 07:52:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:11,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092652782] [2025-03-04 07:52:11,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:11,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:11,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:11,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:11,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:11,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:11,491 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:52:11,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:11,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092652782] [2025-03-04 07:52:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092652782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:11,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:52:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137102624] [2025-03-04 07:52:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:11,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:52:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:11,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:52:11,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:11,493 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:11,906 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2025-03-04 07:52:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:52:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:11,907 INFO L225 Difference]: With dead ends: 160 [2025-03-04 07:52:11,908 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 07:52:11,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:52:11,908 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 193 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 263 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 07:52:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2025-03-04 07:52:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 114 states have (on average 1.412280701754386) internal successors, (161), 148 states have internal predecessors, (161), 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:52:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2025-03-04 07:52:11,912 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 16 [2025-03-04 07:52:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:11,912 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2025-03-04 07:52:11,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2025-03-04 07:52:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:52:11,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:11,912 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:11,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:52:11,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:11,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1061619144, now seen corresponding path program 1 times [2025-03-04 07:52:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387930899] [2025-03-04 07:52:11,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:11,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:52:11,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:52:11,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:11,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387930899] [2025-03-04 07:52:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387930899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855272908] [2025-03-04 07:52:12,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:12,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:12,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:12,091 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:52:12,093 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:52:12,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:52:12,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:52:12,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:12,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:12,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:52:12,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:12,202 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:52:12,207 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:52:12,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:12,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:52:12,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:12,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:52:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:12,698 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 10 treesize of output 8 [2025-03-04 07:52:12,704 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 14 treesize of output 12 [2025-03-04 07:52:12,714 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 10 treesize of output 8 [2025-03-04 07:52:12,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855272908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:12,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2025-03-04 07:52:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553803340] [2025-03-04 07:52:12,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:12,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:52:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:12,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:52:12,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:52:12,731 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:52:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,109 INFO L93 Difference]: Finished difference Result 188 states and 211 transitions. [2025-03-04 07:52:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:52:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:52:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,111 INFO L225 Difference]: With dead ends: 188 [2025-03-04 07:52:13,111 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 07:52:13,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:52:13,112 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 246 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 558 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 07:52:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2025-03-04 07:52:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.396694214876033) internal successors, (169), 155 states have internal predecessors, (169), 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:52:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2025-03-04 07:52:13,117 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 21 [2025-03-04 07:52:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,117 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2025-03-04 07:52:13,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:52:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2025-03-04 07:52:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:52:13,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,125 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:52:13,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 07:52:13,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1440924387, now seen corresponding path program 1 times [2025-03-04 07:52:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811729400] [2025-03-04 07:52:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:52:13,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:52:13,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:13,368 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:52:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811729400] [2025-03-04 07:52:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811729400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236773536] [2025-03-04 07:52:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:13,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:13,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:13,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:13,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:13,369 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,482 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2025-03-04 07:52:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:13,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-04 07:52:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,483 INFO L225 Difference]: With dead ends: 160 [2025-03-04 07:52:13,483 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 07:52:13,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:13,483 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 331 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 07:52:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-03-04 07:52:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 154 states have internal predecessors, (166), 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:52:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2025-03-04 07:52:13,486 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 22 [2025-03-04 07:52:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,486 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2025-03-04 07:52:13,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2025-03-04 07:52:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:52:13,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:52:13,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:13,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 513983014, now seen corresponding path program 1 times [2025-03-04 07:52:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309285836] [2025-03-04 07:52:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:52:13,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:52:13,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:13,545 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:52:13,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:13,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309285836] [2025-03-04 07:52:13,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309285836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:13,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:13,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419520588] [2025-03-04 07:52:13,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:13,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:13,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:13,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:13,547 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:52:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,629 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2025-03-04 07:52:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 24 [2025-03-04 07:52:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,630 INFO L225 Difference]: With dead ends: 159 [2025-03-04 07:52:13,630 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 07:52:13,630 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:52:13,631 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 15 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 283 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 07:52:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-03-04 07:52:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 153 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-03-04 07:52:13,633 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 24 [2025-03-04 07:52:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,634 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-03-04 07:52:13,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:52:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-03-04 07:52:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:52:13,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:52:13,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1408803188, now seen corresponding path program 1 times [2025-03-04 07:52:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597374442] [2025-03-04 07:52:13,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:52:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:52:13,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:13,709 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:52:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597374442] [2025-03-04 07:52:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597374442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914667066] [2025-03-04 07:52:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:13,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:13,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:13,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:13,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:13,712 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,804 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2025-03-04 07:52:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:52:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,805 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:52:13,805 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:52:13,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:13,805 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 317 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:52:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 07:52:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 152 states have internal predecessors, (163), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-03-04 07:52:13,808 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 24 [2025-03-04 07:52:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,808 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-03-04 07:52:13,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-03-04 07:52:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:52:13,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:52:13,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:13,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1408803187, now seen corresponding path program 1 times [2025-03-04 07:52:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212862272] [2025-03-04 07:52:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:52:13,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:52:13,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212862272] [2025-03-04 07:52:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212862272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047962341] [2025-03-04 07:52:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:13,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:13,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:13,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:13,957 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:14,068 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2025-03-04 07:52:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:52:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:14,069 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:14,069 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:14,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:14,069 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:14,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 307 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-04 07:52:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.35) internal successors, (162), 151 states have internal predecessors, (162), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2025-03-04 07:52:14,073 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 24 [2025-03-04 07:52:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:14,074 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2025-03-04 07:52:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2025-03-04 07:52:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:52:14,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:14,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:14,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:52:14,075 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1050640870, now seen corresponding path program 1 times [2025-03-04 07:52:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221791233] [2025-03-04 07:52:14,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:14,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:52:14,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:52:14,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:14,183 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:52:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:14,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221791233] [2025-03-04 07:52:14,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221791233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:14,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:14,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:14,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284408765] [2025-03-04 07:52:14,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:14,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:14,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:14,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:14,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:14,185 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:52:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:14,262 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-03-04 07:52:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 27 [2025-03-04 07:52:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:14,263 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:14,263 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:14,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:52:14,264 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:14,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 258 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-04 07:52:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 150 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2025-03-04 07:52:14,268 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2025-03-04 07:52:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:14,268 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2025-03-04 07:52:14,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:52:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2025-03-04 07:52:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:52:14,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:14,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:14,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:52:14,271 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:14,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1895473527, now seen corresponding path program 1 times [2025-03-04 07:52:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:14,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881015140] [2025-03-04 07:52:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:14,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:52:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:52:14,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881015140] [2025-03-04 07:52:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881015140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:14,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56225484] [2025-03-04 07:52:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:14,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:14,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:14,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:14,296 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:14,327 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2025-03-04 07:52:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:14,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 07:52:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:14,328 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:52:14,328 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:52:14,328 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:52:14,328 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 64 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:14,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:52:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 07:52:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 152 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-03-04 07:52:14,331 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 27 [2025-03-04 07:52:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:14,331 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-03-04 07:52:14,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-03-04 07:52:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:14,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:14,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:14,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:52:14,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2062616762, now seen corresponding path program 1 times [2025-03-04 07:52:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6893573] [2025-03-04 07:52:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:14,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:14,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:14,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:14,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:14,488 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:52:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6893573] [2025-03-04 07:52:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6893573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:52:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629493541] [2025-03-04 07:52:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:52:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:14,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:52:14,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:14,489 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:14,679 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2025-03-04 07:52:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:14,680 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:52:14,681 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:52:14,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:52:14,681 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:14,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 303 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:52:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2025-03-04 07:52:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.319672131147541) internal successors, (161), 151 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2025-03-04 07:52:14,684 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 28 [2025-03-04 07:52:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2025-03-04 07:52:14,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2025-03-04 07:52:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:14,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:14,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:14,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:52:14,685 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:14,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2062616761, now seen corresponding path program 1 times [2025-03-04 07:52:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25688943] [2025-03-04 07:52:14,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:14,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:14,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:14,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:14,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:14,922 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:52:14,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:14,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25688943] [2025-03-04 07:52:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25688943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:14,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:14,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907735508] [2025-03-04 07:52:14,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:14,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:14,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:14,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:14,924 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:15,162 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2025-03-04 07:52:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:15,163 INFO L225 Difference]: With dead ends: 149 [2025-03-04 07:52:15,163 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 07:52:15,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:52:15,163 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:15,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 357 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 07:52:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2025-03-04 07:52:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 128 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-03-04 07:52:15,167 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 28 [2025-03-04 07:52:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:15,167 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-03-04 07:52:15,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-03-04 07:52:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:52:15,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:15,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:15,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:52:15,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:15,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:15,168 INFO L85 PathProgramCache]: Analyzing trace with hash -406464549, now seen corresponding path program 1 times [2025-03-04 07:52:15,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:15,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919921256] [2025-03-04 07:52:15,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:15,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:52:15,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:52:15,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:15,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:15,234 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:52:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919921256] [2025-03-04 07:52:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919921256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:15,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14673266] [2025-03-04 07:52:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:15,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:15,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:15,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:15,236 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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:52:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:15,311 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2025-03-04 07:52:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 29 [2025-03-04 07:52:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:15,312 INFO L225 Difference]: With dead ends: 130 [2025-03-04 07:52:15,312 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 07:52:15,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:15,313 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 163 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:15,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 91 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 07:52:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-04 07:52:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2025-03-04 07:52:15,315 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 29 [2025-03-04 07:52:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:15,316 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2025-03-04 07:52:15,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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:52:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2025-03-04 07:52:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:52:15,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:15,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:15,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:52:15,316 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1014097975, now seen corresponding path program 1 times [2025-03-04 07:52:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471557946] [2025-03-04 07:52:15,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:15,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:52:15,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:52:15,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:15,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471557946] [2025-03-04 07:52:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471557946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355296656] [2025-03-04 07:52:15,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:15,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:15,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:15,384 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:52:15,385 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:52:15,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:52:15,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:52:15,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:15,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:15,464 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 13 treesize of output 9 [2025-03-04 07:52:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:15,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355296656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:52:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2025-03-04 07:52:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354524220] [2025-03-04 07:52:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:15,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:15,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:15,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:15,494 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:15,545 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2025-03-04 07:52:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:52:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:15,546 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:52:15,546 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:52:15,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:15,546 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:15,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 260 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:52:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2025-03-04 07:52:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.2660550458715596) internal successors, (138), 130 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-04 07:52:15,549 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 29 [2025-03-04 07:52:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:15,549 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-04 07:52:15,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-04 07:52:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:52:15,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:15,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:15,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:52:15,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:52:15,753 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2116801638, now seen corresponding path program 1 times [2025-03-04 07:52:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47616371] [2025-03-04 07:52:15,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:15,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:52:15,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:52:15,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:15,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:15,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:15,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47616371] [2025-03-04 07:52:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47616371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:15,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059641708] [2025-03-04 07:52:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:15,804 INFO L229 MonitoredProcess]: Starting monitored process 4 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:52:15,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:52:15,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:52:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:52:15,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:15,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:15,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:52:15,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:15,926 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 13 treesize of output 9 [2025-03-04 07:52:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:15,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059641708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:15,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 07:52:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908956994] [2025-03-04 07:52:15,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:15,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:15,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:15,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:15,976 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:16,048 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2025-03-04 07:52:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 07:52:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:16,051 INFO L225 Difference]: With dead ends: 159 [2025-03-04 07:52:16,051 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:52:16,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:16,052 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:16,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 215 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:52:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2025-03-04 07:52:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 136 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2025-03-04 07:52:16,056 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 30 [2025-03-04 07:52:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:16,056 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2025-03-04 07:52:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2025-03-04 07:52:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:52:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:16,056 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:16,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:52:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:16,257 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2116802790, now seen corresponding path program 1 times [2025-03-04 07:52:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:16,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143039487] [2025-03-04 07:52:16,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:16,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:52:16,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:52:16,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:16,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143039487] [2025-03-04 07:52:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143039487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171514636] [2025-03-04 07:52:16,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:16,423 INFO L229 MonitoredProcess]: Starting monitored process 5 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:52:16,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:52:16,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:52:16,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:52:16,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:16,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:16,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:52:16,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:16,507 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:52:16,510 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:52:16,516 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 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:52:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 07:52:16,542 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 07:52:16,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-03-04 07:52:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:16,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171514636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:16,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2025-03-04 07:52:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117197152] [2025-03-04 07:52:16,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:16,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:52:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:16,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:52:16,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:16,726 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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:52:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:17,013 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2025-03-04 07:52:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:52:17,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 07:52:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:17,014 INFO L225 Difference]: With dead ends: 157 [2025-03-04 07:52:17,014 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:52:17,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:52:17,014 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 19 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:17,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 456 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:52:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2025-03-04 07:52:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 126 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2025-03-04 07:52:17,017 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2025-03-04 07:52:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:17,017 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2025-03-04 07:52:17,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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:52:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2025-03-04 07:52:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:52:17,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:17,018 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:17,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:17,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:17,218 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:17,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash -658615236, now seen corresponding path program 1 times [2025-03-04 07:52:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:17,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370310002] [2025-03-04 07:52:17,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:17,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:52:17,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:52:17,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:17,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:17,574 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:52:17,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370310002] [2025-03-04 07:52:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370310002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047763199] [2025-03-04 07:52:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:17,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:17,577 INFO L229 MonitoredProcess]: Starting monitored process 6 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:52:17,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:52:17,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:52:17,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:52:17,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:17,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:17,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:52:17,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:17,676 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:52:17,692 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:52:17,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:52:17,731 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:52:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:17,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:17,753 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:52:17,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:17,802 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 41 treesize of output 38 [2025-03-04 07:52:17,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:17,824 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 16 treesize of output 8 [2025-03-04 07:52:17,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:17,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:17,901 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:52:17,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:17,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-04 07:52:17,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-04 07:52:17,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_903) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_904) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-04 07:52:18,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:18,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-03-04 07:52:18,031 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 70 treesize of output 62 [2025-03-04 07:52:18,034 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 29 treesize of output 27 [2025-03-04 07:52:18,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (forall ((v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_902 Int) (v_arrayElimCell_23 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_902)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_23 v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not .cse2)) (forall ((v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_902 Int) (v_arrayElimCell_23 Int)) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_902)))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_23 v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or .cse2 (forall ((v_ArrVal_906 (Array Int Int)) (v_ArrVal_902 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_902)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) is different from false [2025-03-04 07:52:25,167 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 12 treesize of output 8 [2025-03-04 07:52:25,170 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 11 treesize of output 7 [2025-03-04 07:52:25,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:52:25,179 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-04 07:52:25,179 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 1 [2025-03-04 07:52:25,182 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:52:25,184 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-04 07:52:25,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2025-03-04 07:52:30,586 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:52:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047763199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:30,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 25 [2025-03-04 07:52:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089294875] [2025-03-04 07:52:30,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:30,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:52:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:52:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=330, Unknown=20, NotChecked=164, Total=600 [2025-03-04 07:52:30,587 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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:52:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:31,728 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2025-03-04 07:52:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:52:31,729 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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 37 [2025-03-04 07:52:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:31,730 INFO L225 Difference]: With dead ends: 208 [2025-03-04 07:52:31,730 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 07:52:31,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=287, Invalid=897, Unknown=22, NotChecked=276, Total=1482 [2025-03-04 07:52:31,731 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 399 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 48 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:31,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 652 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 901 Invalid, 13 Unknown, 744 Unchecked, 0.7s Time] [2025-03-04 07:52:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 07:52:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 154. [2025-03-04 07:52:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.2442748091603053) internal successors, (163), 152 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-03-04 07:52:31,736 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 37 [2025-03-04 07:52:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:31,736 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-03-04 07:52:31,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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:52:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-03-04 07:52:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:52:31,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:31,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:31,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:52:31,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:52:31,939 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:31,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1952716354, now seen corresponding path program 1 times [2025-03-04 07:52:31,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:31,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884197008] [2025-03-04 07:52:31,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:52:31,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:52:31,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:31,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:32,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884197008] [2025-03-04 07:52:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884197008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44156863] [2025-03-04 07:52:32,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:32,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:32,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:32,286 INFO L229 MonitoredProcess]: Starting monitored process 7 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:52:32,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:52:32,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:52:32,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:52:32,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:32,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:32,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:52:32,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:32,391 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:52:32,453 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:52:32,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:52:32,488 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:52:32,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:32,574 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:52:32,671 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:52:32,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 07:52:32,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:32,704 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:52:32,851 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:52:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:32,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:33,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1003 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1005)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|)) 1) (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) is different from false [2025-03-04 07:52:33,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1003 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1003))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1005)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|)) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) is different from false [2025-03-04 07:52:33,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:33,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2025-03-04 07:52:33,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:33,242 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 252 treesize of output 227 [2025-03-04 07:52:33,250 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 171 treesize of output 163 [2025-03-04 07:52:33,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:33,260 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 163 treesize of output 159 [2025-03-04 07:52:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:34,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44156863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:34,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:34,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35 [2025-03-04 07:52:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810954885] [2025-03-04 07:52:34,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:34,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:52:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:34,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:52:34,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=947, Unknown=11, NotChecked=130, Total=1260 [2025-03-04 07:52:34,952 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 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:52:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:36,101 INFO L93 Difference]: Finished difference Result 283 states and 309 transitions. [2025-03-04 07:52:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:52:36,101 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-04 07:52:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:36,102 INFO L225 Difference]: With dead ends: 283 [2025-03-04 07:52:36,102 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 07:52:36,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=1442, Unknown=11, NotChecked=162, Total=1892 [2025-03-04 07:52:36,103 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 589 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:36,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 723 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1530 Invalid, 0 Unknown, 479 Unchecked, 0.9s Time] [2025-03-04 07:52:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 07:52:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 188. [2025-03-04 07:52:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 165 states have (on average 1.2181818181818183) internal successors, (201), 186 states have internal predecessors, (201), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2025-03-04 07:52:36,106 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 42 [2025-03-04 07:52:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:36,106 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2025-03-04 07:52:36,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 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:52:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2025-03-04 07:52:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:52:36,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:36,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:36,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:52:36,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:36,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1952716353, now seen corresponding path program 1 times [2025-03-04 07:52:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274367383] [2025-03-04 07:52:36,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:36,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:52:36,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:52:36,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:36,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274367383] [2025-03-04 07:52:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274367383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060702911] [2025-03-04 07:52:36,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:36,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:36,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:36,710 INFO L229 MonitoredProcess]: Starting monitored process 8 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:52:36,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:52:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:52:36,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:52:36,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:36,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:36,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:52:36,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:36,814 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:52:36,863 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 8 treesize of output 1 [2025-03-04 07:52:36,870 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:52:36,870 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:52:36,887 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:52:36,891 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:52:36,956 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:36,956 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 41 treesize of output 38 [2025-03-04 07:52:36,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:37,017 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:52:37,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:52:37,036 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:52:37,036 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:52:37,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:52:37,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:37,228 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:52:37,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:52:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:37,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:38,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,166 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 73 treesize of output 74 [2025-03-04 07:52:38,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,171 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 86 treesize of output 62 [2025-03-04 07:52:38,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,179 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 449 treesize of output 384 [2025-03-04 07:52:38,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,201 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 458 treesize of output 441 [2025-03-04 07:52:38,209 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 116 treesize of output 110 [2025-03-04 07:52:38,213 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 110 treesize of output 104 [2025-03-04 07:52:38,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,224 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 86 treesize of output 82 [2025-03-04 07:52:38,228 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 64 treesize of output 62 [2025-03-04 07:52:38,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-03-04 07:52:38,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2025-03-04 07:52:38,353 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 79 treesize of output 67 [2025-03-04 07:52:38,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,367 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 186 treesize of output 181 [2025-03-04 07:52:38,374 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 64 treesize of output 62 [2025-03-04 07:52:38,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2025-03-04 07:52:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2025-03-04 07:52:38,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:38,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 195 [2025-03-04 07:52:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:38,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060702911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:38,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:38,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2025-03-04 07:52:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446047938] [2025-03-04 07:52:38,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:38,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:52:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:38,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:52:38,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1432, Unknown=6, NotChecked=0, Total=1560 [2025-03-04 07:52:38,934 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 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:52:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:40,464 INFO L93 Difference]: Finished difference Result 244 states and 266 transitions. [2025-03-04 07:52:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:52:40,465 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-04 07:52:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:40,466 INFO L225 Difference]: With dead ends: 244 [2025-03-04 07:52:40,466 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 07:52:40,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=375, Invalid=2811, Unknown=6, NotChecked=0, Total=3192 [2025-03-04 07:52:40,466 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 699 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:40,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 943 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:52:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 07:52:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 191. [2025-03-04 07:52:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.2142857142857142) internal successors, (204), 189 states have internal predecessors, (204), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 207 transitions. [2025-03-04 07:52:40,471 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 207 transitions. Word has length 42 [2025-03-04 07:52:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 207 transitions. [2025-03-04 07:52:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 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:52:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 207 transitions. [2025-03-04 07:52:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:52:40,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:40,471 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:40,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:40,672 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-04 07:52:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -39034031, now seen corresponding path program 1 times [2025-03-04 07:52:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618156776] [2025-03-04 07:52:40,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:40,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:52:40,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:52:40,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:40,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:41,237 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:52:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618156776] [2025-03-04 07:52:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618156776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923547429] [2025-03-04 07:52:41,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:41,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:41,239 INFO L229 MonitoredProcess]: Starting monitored process 9 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:52:41,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:52:41,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:52:41,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:52:41,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:41,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:41,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 07:52:41,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:41,352 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:52:41,365 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:52:41,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:52:41,397 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:52:41,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:41,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:41,415 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:52:41,460 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:41,460 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 41 treesize of output 38 [2025-03-04 07:52:41,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:41,481 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 16 treesize of output 8 [2025-03-04 07:52:41,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:41,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:41,540 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:52:41,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 07:52:41,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:52:41,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:41,633 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:41,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2025-03-04 07:52:41,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:41,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 07:52:41,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:41,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:52:41,701 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:52:41,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:41,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-04 07:52:41,816 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1264) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1265) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1267)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-04 07:52:41,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:41,822 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 33 treesize of output 34 [2025-03-04 07:52:41,824 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 60 treesize of output 52 [2025-03-04 07:52:41,826 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 24 treesize of output 22 [2025-03-04 07:52:41,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (not .cse0) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1264) v_arrayElimCell_84 v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (or .cse0 (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1261))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1264 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1264) v_arrayElimCell_84 v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) is different from false [2025-03-04 07:52:42,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:42,306 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 183 treesize of output 152 [2025-03-04 07:52:42,310 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 287 treesize of output 263 [2025-03-04 07:52:42,315 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 249 treesize of output 243 [2025-03-04 07:52:42,457 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2025-03-04 07:52:42,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 250 treesize of output 360 [2025-03-04 07:52:42,469 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 260 treesize of output 248 [2025-03-04 07:52:52,817 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse8 (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_84 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= (select (select (store .cse39 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse39 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (.cse19 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (.cse0 (not .cse5))) (and (or .cse0 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))) (or .cse0 (and (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (or (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_21 (Array Int Int))) (= 1 (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) (= v_prenex_22 v_arrayElimCell_86))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_86 Int)) (or (= v_prenex_22 v_arrayElimCell_86) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25))) (or (= (select (select (store (store .cse4 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= 1 (select (select (store .cse4 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))))) (or .cse5 (and (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= 1 (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store .cse7 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= (select (select (store (store .cse7 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))))) .cse8)) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= 1 (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store .cse10 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse10 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))))) (or (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) .cse0) (or .cse0 (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25))) (or (= (select (select (store (store .cse11 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= 1 (select (select (store .cse11 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86)))))) (or .cse5 (and .cse8 (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_86 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (forall ((v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1264 (Array Int Int))) (= (select (select (store (store .cse13 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse13 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_21 (Array Int Int))) (= 1 (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))))) (or .cse0 (and (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (or (= 1 (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25))) (or (= (select (select (store (store .cse16 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= 1 (select (select (store .cse16 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))))))) (or .cse0 (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25))) (or (= (select (select (store (store .cse17 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= 1 (select (select (store .cse17 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))))) (or .cse5 .cse19) (or .cse5 (and (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)))) (or (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93)))) .cse19)) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))) (or .cse0 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store .cse22 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse22 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22)))) .cse5) (or .cse0 (and (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_86 Int)) (or (= v_prenex_22 v_arrayElimCell_86) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25))) (or (= (select (select (store (store .cse23 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= 1 (select (select (store .cse23 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (or (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_21 (Array Int Int))) (= 1 (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse26 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= 1 (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store .cse26 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= (select (select (store (store .cse26 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))))) (or .cse5 (and (forall ((v_arrayElimCell_93 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)))) (or (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93))) .cse19)) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))) (or .cse5 (and .cse19 (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)))) (or (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse31 (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= 1 (select (select (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store .cse31 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse31 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86))))))) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1257 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1256)))) (or (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1257) v_arrayElimCell_93 v_ArrVal_1261) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1267) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1264 (Array Int Int))) (= (select (select (store (store .cse33 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse33 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_21 (Array Int Int))) (= 1 (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (= v_prenex_22 v_arrayElimCell_86))))) (or .cse0 (and (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (or (= 1 (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86)))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25))) (or (= (select (select (store (store .cse36 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= 1 (select (select (store .cse36 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_prenex_22 v_arrayElimCell_86)))))))) (forall ((v_prenex_22 Int)) (or (= v_prenex_22 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) (forall ((v_arrayElimCell_84 Int) (v_prenex_21 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_24)))) (let ((.cse38 (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25))) (or (= 1 (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_86 v_prenex_25) v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (select (select (store .cse38 v_prenex_22 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse38 v_prenex_22 v_ArrVal_1264) v_arrayElimCell_84 v_prenex_23) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_22 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))))))))) is different from false