./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:35:54,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:35:54,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:35:54,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:35:54,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:35:54,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:35:54,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:35:54,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:35:54,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:35:54,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:35:54,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:35:54,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:35:54,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:35:54,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:35:54,834 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:35:54,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:35:54,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:35:54,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:35:54,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:35:54,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:35:54,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:35:54,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:35:54,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:35:54,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:35:54,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:35:54,837 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2025-01-09 22:35:55,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:35:55,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:35:55,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:35:55,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:35:55,031 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:35:55,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2025-01-09 22:35:56,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/661278a51/23b9fb999ffe45e288a5d10c79733427/FLAGf0512f883 [2025-01-09 22:35:56,371 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:35:56,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2025-01-09 22:35:56,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/661278a51/23b9fb999ffe45e288a5d10c79733427/FLAGf0512f883 [2025-01-09 22:35:56,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/661278a51/23b9fb999ffe45e288a5d10c79733427 [2025-01-09 22:35:56,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:35:56,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:35:56,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:35:56,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:35:56,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:35:56,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a855096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56, skipping insertion in model container [2025-01-09 22:35:56,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:35:56,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:35:56,850 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:35:56,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:35:56,912 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:35:56,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56 WrapperNode [2025-01-09 22:35:56,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:35:56,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:35:56,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:35:56,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:35:56,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,945 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 156 [2025-01-09 22:35:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:35:56,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:35:56,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:35:56,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:35:56,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,967 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-01-09 22:35:56,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:35:56,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:35:56,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:35:56,979 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:35:56,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (1/1) ... [2025-01-09 22:35:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:35:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:57,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:35:57,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:35:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 22:35:57,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:35:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:35:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:35:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:35:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:35:57,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:35:57,098 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:35:57,099 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:35:57,417 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-01-09 22:35:57,417 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:35:57,427 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:35:57,427 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 22:35:57,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:35:57 BoogieIcfgContainer [2025-01-09 22:35:57,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:35:57,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:35:57,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:35:57,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:35:57,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:35:56" (1/3) ... [2025-01-09 22:35:57,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec3780d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:35:57, skipping insertion in model container [2025-01-09 22:35:57,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:35:56" (2/3) ... [2025-01-09 22:35:57,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec3780d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:35:57, skipping insertion in model container [2025-01-09 22:35:57,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:35:57" (3/3) ... [2025-01-09 22:35:57,437 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2025-01-09 22:35:57,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:35:57,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-sentinel-2.i that has 2 procedures, 177 locations, 1 initial locations, 10 loop locations, and 74 error locations. [2025-01-09 22:35:57,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:35:57,479 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;@1970d974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:35:57,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-01-09 22:35:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 94 states have (on average 2.095744680851064) internal successors, (197), 168 states have internal predecessors, (197), 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-01-09 22:35:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:35:57,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:57,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:35:57,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:57,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2025-01-09 22:35:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343110898] [2025-01-09 22:35:57,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:57,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:35:57,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:35:57,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343110898] [2025-01-09 22:35:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343110898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:35:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876063425] [2025-01-09 22:35:57,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:57,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:35:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:57,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:35:57,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:57,666 INFO L87 Difference]: Start difference. First operand has 177 states, 94 states have (on average 2.095744680851064) internal successors, (197), 168 states have internal predecessors, (197), 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-01-09 22:35:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:57,823 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2025-01-09 22:35:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:35:57,825 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-01-09 22:35:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:57,830 INFO L225 Difference]: With dead ends: 194 [2025-01-09 22:35:57,830 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 22:35:57,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:57,833 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 141 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:57,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 122 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 22:35:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2025-01-09 22:35:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 89 states have (on average 1.9550561797752808) internal successors, (174), 165 states have internal predecessors, (174), 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-01-09 22:35:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 181 transitions. [2025-01-09 22:35:57,863 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 181 transitions. Word has length 3 [2025-01-09 22:35:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:57,863 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 181 transitions. [2025-01-09 22:35:57,863 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-01-09 22:35:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 181 transitions. [2025-01-09 22:35:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:35:57,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:57,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:35:57,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:35:57,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:57,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2025-01-09 22:35:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:57,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819974883] [2025-01-09 22:35:57,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:57,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:35:57,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:35:57,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:57,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819974883] [2025-01-09 22:35:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819974883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:35:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720460489] [2025-01-09 22:35:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:57,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:35:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:57,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:35:57,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:57,929 INFO L87 Difference]: Start difference. First operand 167 states and 181 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-01-09 22:35:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:58,039 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2025-01-09 22:35:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:35:58,039 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-01-09 22:35:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:58,040 INFO L225 Difference]: With dead ends: 163 [2025-01-09 22:35:58,040 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 22:35:58,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:58,041 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 150 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:58,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 100 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 22:35:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-01-09 22:35:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 89 states have (on average 1.898876404494382) internal successors, (169), 161 states have internal predecessors, (169), 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-01-09 22:35:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2025-01-09 22:35:58,050 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 3 [2025-01-09 22:35:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:58,050 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2025-01-09 22:35:58,050 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-01-09 22:35:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2025-01-09 22:35:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:35:58,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:58,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:35:58,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1466876622, now seen corresponding path program 1 times [2025-01-09 22:35:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221320882] [2025-01-09 22:35:58,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:58,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:35:58,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:35:58,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:58,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221320882] [2025-01-09 22:35:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221320882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:35:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358208756] [2025-01-09 22:35:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:58,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:35:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:58,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:35:58,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:58,157 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:58,276 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-01-09 22:35:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:35:58,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:35:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:58,277 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:35:58,278 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:35:58,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:58,278 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 118 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:58,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 109 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:35:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 22:35:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 155 states have internal predecessors, (164), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-01-09 22:35:58,287 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 7 [2025-01-09 22:35:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:58,287 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-01-09 22:35:58,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-01-09 22:35:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:35:58,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:58,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:58,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:35:58,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1466876623, now seen corresponding path program 1 times [2025-01-09 22:35:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:58,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400343618] [2025-01-09 22:35:58,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:58,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:35:58,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:35:58,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:58,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400343618] [2025-01-09 22:35:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400343618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:35:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24402629] [2025-01-09 22:35:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:58,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:35:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:58,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:35:58,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:58,381 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:58,482 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2025-01-09 22:35:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:35:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:35:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:58,483 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:35:58,483 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:35:58,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:35:58,485 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 112 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:58,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 125 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:35:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-01-09 22:35:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 97 states have (on average 1.731958762886598) internal successors, (168), 159 states have internal predecessors, (168), 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-01-09 22:35:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2025-01-09 22:35:58,494 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 7 [2025-01-09 22:35:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:58,494 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2025-01-09 22:35:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2025-01-09 22:35:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:35:58,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:58,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:58,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:35:58,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1076673748, now seen corresponding path program 1 times [2025-01-09 22:35:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641738055] [2025-01-09 22:35:58,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:58,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:58,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:35:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:35:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641738055] [2025-01-09 22:35:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641738055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:35:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402005161] [2025-01-09 22:35:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:58,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:35:58,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:58,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:35:58,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:35:58,631 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:58,778 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2025-01-09 22:35:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:35:58,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-01-09 22:35:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:58,779 INFO L225 Difference]: With dead ends: 148 [2025-01-09 22:35:58,779 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 22:35:58,780 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-01-09 22:35:58,780 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 155 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:58,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 96 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 22:35:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-01-09 22:35:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.5858585858585859) internal successors, (157), 146 states have internal predecessors, (157), 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-01-09 22:35:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2025-01-09 22:35:58,788 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 14 [2025-01-09 22:35:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2025-01-09 22:35:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2025-01-09 22:35:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:35:58,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:58,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:58,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:35:58,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:58,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1076673749, now seen corresponding path program 1 times [2025-01-09 22:35:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:58,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564332713] [2025-01-09 22:35:58,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:35:58,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:35:58,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:58,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564332713] [2025-01-09 22:35:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564332713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:35:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232043296] [2025-01-09 22:35:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:58,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:35:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:58,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:35:58,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:35:58,948 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:59,123 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2025-01-09 22:35:59,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:35:59,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-01-09 22:35:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:59,124 INFO L225 Difference]: With dead ends: 162 [2025-01-09 22:35:59,124 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 22:35:59,124 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-01-09 22:35:59,124 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 132 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:59,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 149 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:35:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 22:35:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2025-01-09 22:35:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 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-01-09 22:35:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2025-01-09 22:35:59,128 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 14 [2025-01-09 22:35:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:59,128 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2025-01-09 22:35:59,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2025-01-09 22:35:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:35:59,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:59,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:59,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:35:59,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:59,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash 543952305, now seen corresponding path program 1 times [2025-01-09 22:35:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329771822] [2025-01-09 22:35:59,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:59,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:35:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:35:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329771822] [2025-01-09 22:35:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329771822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:35:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604234953] [2025-01-09 22:35:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:59,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:35:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:59,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:35:59,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:35:59,193 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-01-09 22:35:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:59,340 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2025-01-09 22:35:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:35:59,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2025-01-09 22:35:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:59,342 INFO L225 Difference]: With dead ends: 195 [2025-01-09 22:35:59,342 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 22:35:59,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:35:59,342 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 285 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:59,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 172 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 22:35:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 161. [2025-01-09 22:35:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.5175438596491229) internal successors, (173), 159 states have internal predecessors, (173), 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-01-09 22:35:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 179 transitions. [2025-01-09 22:35:59,346 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 179 transitions. Word has length 17 [2025-01-09 22:35:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 179 transitions. [2025-01-09 22:35:59,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-01-09 22:35:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2025-01-09 22:35:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:35:59,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:59,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:59,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:35:59,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:59,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash 371876063, now seen corresponding path program 1 times [2025-01-09 22:35:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104478659] [2025-01-09 22:35:59,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:35:59,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:35:59,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:59,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104478659] [2025-01-09 22:35:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104478659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:35:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279990450] [2025-01-09 22:35:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:35:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:59,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:35:59,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:35:59,459 INFO L87 Difference]: Start difference. First operand 161 states and 179 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:59,588 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2025-01-09 22:35:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:35:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-01-09 22:35:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:59,592 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:35:59,592 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:35:59,592 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-01-09 22:35:59,592 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 4 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:59,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 364 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:35:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-09 22:35:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 114 states have (on average 1.5) internal successors, (171), 158 states have internal predecessors, (171), 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-01-09 22:35:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2025-01-09 22:35:59,599 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 17 [2025-01-09 22:35:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:59,600 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2025-01-09 22:35:59,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2025-01-09 22:35:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:35:59,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:59,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:59,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:35:59,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:59,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 371876064, now seen corresponding path program 1 times [2025-01-09 22:35:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:59,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634130097] [2025-01-09 22:35:59,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:59,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:35:59,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:35:59,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:59,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634130097] [2025-01-09 22:35:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634130097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:35:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:35:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:35:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311979445] [2025-01-09 22:35:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:35:59,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:35:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:59,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:35:59,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:35:59,794 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:59,921 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2025-01-09 22:35:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:35:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-01-09 22:35:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:59,923 INFO L225 Difference]: With dead ends: 159 [2025-01-09 22:35:59,923 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 22:35:59,923 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-01-09 22:35:59,923 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:59,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 355 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:35:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 22:35:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-01-09 22:35:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 114 states have (on average 1.4824561403508771) internal successors, (169), 157 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-01-09 22:35:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2025-01-09 22:35:59,927 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 17 [2025-01-09 22:35:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:59,927 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2025-01-09 22:35:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:35:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2025-01-09 22:35:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:35:59,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:59,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:59,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:35:59,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:35:59,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash -657117964, now seen corresponding path program 1 times [2025-01-09 22:35:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193738729] [2025-01-09 22:35:59,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:59,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:35:59,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:35:59,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:59,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:00,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193738729] [2025-01-09 22:36:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193738729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:00,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:36:00,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555218824] [2025-01-09 22:36:00,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:00,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:36:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:00,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:36:00,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:36:00,113 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-01-09 22:36:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:00,302 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2025-01-09 22:36:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:36:00,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 20 [2025-01-09 22:36:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:00,303 INFO L225 Difference]: With dead ends: 199 [2025-01-09 22:36:00,304 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 22:36:00,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:36:00,304 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 265 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:00,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 352 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 22:36:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 164. [2025-01-09 22:36:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 162 states have internal predecessors, (174), 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-01-09 22:36:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2025-01-09 22:36:00,307 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 20 [2025-01-09 22:36:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:00,308 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2025-01-09 22:36:00,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-01-09 22:36:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2025-01-09 22:36:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:36:00,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:00,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:00,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:36:00,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:00,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1179364193, now seen corresponding path program 1 times [2025-01-09 22:36:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21831806] [2025-01-09 22:36:00,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:00,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:36:00,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:36:00,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:00,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:00,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21831806] [2025-01-09 22:36:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21831806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:00,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:36:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228334162] [2025-01-09 22:36:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:00,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:36:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:00,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:36:00,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:00,476 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:00,739 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2025-01-09 22:36:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:36:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:36:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:00,740 INFO L225 Difference]: With dead ends: 163 [2025-01-09 22:36:00,740 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 22:36:00,741 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-01-09 22:36:00,741 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 148 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:00,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 236 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 22:36:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-01-09 22:36:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.453781512605042) internal successors, (173), 161 states have internal predecessors, (173), 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-01-09 22:36:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2025-01-09 22:36:00,743 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 21 [2025-01-09 22:36:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:00,743 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2025-01-09 22:36:00,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2025-01-09 22:36:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:36:00,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:00,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:00,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:36:00,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:00,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1179364194, now seen corresponding path program 1 times [2025-01-09 22:36:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:00,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392480008] [2025-01-09 22:36:00,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:00,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:36:00,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:36:00,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:00,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392480008] [2025-01-09 22:36:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392480008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:00,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:36:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559337054] [2025-01-09 22:36:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:36:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:00,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:36:00,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:36:00,996 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:01,388 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2025-01-09 22:36:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:36:01,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 22:36:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:01,389 INFO L225 Difference]: With dead ends: 178 [2025-01-09 22:36:01,389 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 22:36:01,390 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-01-09 22:36:01,390 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 195 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:01,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 355 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:36:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 22:36:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2025-01-09 22:36:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 165 states have internal predecessors, (181), 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-01-09 22:36:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2025-01-09 22:36:01,395 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 21 [2025-01-09 22:36:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:01,395 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2025-01-09 22:36:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2025-01-09 22:36:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:36:01,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:01,396 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] [2025-01-09 22:36:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:36:01,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 917351358, now seen corresponding path program 1 times [2025-01-09 22:36:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375463433] [2025-01-09 22:36:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:36:01,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:36:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:01,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:01,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:01,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375463433] [2025-01-09 22:36:01,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375463433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:01,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857106141] [2025-01-09 22:36:01,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:01,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:01,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:01,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:36:01,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:36:01,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:36:01,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:36:01,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:01,742 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-01-09 22:36:01,750 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-01-09 22:36:01,781 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-01-09 22:36:01,787 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-01-09 22:36:01,824 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-01-09 22:36:01,833 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-01-09 22:36:01,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 22:36:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:02,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:02,253 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-01-09 22:36:02,256 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-01-09 22:36:02,265 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-01-09 22:36:02,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857106141] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:02,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 16 [2025-01-09 22:36:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214464954] [2025-01-09 22:36:02,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:36:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:02,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:36:02,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:36:02,281 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:02,711 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2025-01-09 22:36:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:36:02,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 22:36:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:02,712 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:36:02,712 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:36:02,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:36:02,712 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 319 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:02,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 546 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:36:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:36:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 174. [2025-01-09 22:36:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 172 states have internal predecessors, (189), 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-01-09 22:36:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2025-01-09 22:36:02,716 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 25 [2025-01-09 22:36:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:02,716 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2025-01-09 22:36:02,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2025-01-09 22:36:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:36:02,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:02,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:02,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:36:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:36:02,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1247196991, now seen corresponding path program 1 times [2025-01-09 22:36:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087876880] [2025-01-09 22:36:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:36:02,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:36:02,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:02,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087876880] [2025-01-09 22:36:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087876880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:36:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679633800] [2025-01-09 22:36:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:36:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:02,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:36:02,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:02,965 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:03,079 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2025-01-09 22:36:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:03,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 22:36:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:03,081 INFO L225 Difference]: With dead ends: 178 [2025-01-09 22:36:03,081 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 22:36:03,081 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-01-09 22:36:03,081 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:03,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 22:36:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2025-01-09 22:36:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.3777777777777778) internal successors, (186), 171 states have internal predecessors, (186), 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-01-09 22:36:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2025-01-09 22:36:03,086 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 26 [2025-01-09 22:36:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:03,086 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2025-01-09 22:36:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2025-01-09 22:36:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:36:03,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:03,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:03,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:36:03,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:03,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1982570622, now seen corresponding path program 1 times [2025-01-09 22:36:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637861713] [2025-01-09 22:36:03,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:03,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:36:03,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:36:03,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:03,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637861713] [2025-01-09 22:36:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637861713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:03,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079553268] [2025-01-09 22:36:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:36:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:03,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:36:03,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:36:03,155 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 4 states, 4 states have (on average 7.0) 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-01-09 22:36:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:03,229 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2025-01-09 22:36:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:36:03,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) 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-01-09 22:36:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:03,230 INFO L225 Difference]: With dead ends: 177 [2025-01-09 22:36:03,230 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 22:36:03,231 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-01-09 22:36:03,231 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 16 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:03,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 312 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 22:36:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2025-01-09 22:36:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.362962962962963) internal successors, (184), 170 states have internal predecessors, (184), 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-01-09 22:36:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2025-01-09 22:36:03,235 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 29 [2025-01-09 22:36:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:03,235 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2025-01-09 22:36:03,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) 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-01-09 22:36:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2025-01-09 22:36:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:36:03,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:03,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:36:03,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1721060718, now seen corresponding path program 1 times [2025-01-09 22:36:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190942646] [2025-01-09 22:36:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:36:03,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:36:03,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:03,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:03,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190942646] [2025-01-09 22:36:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190942646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:03,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014773981] [2025-01-09 22:36:03,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:03,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:36:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:03,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:36:03,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:03,328 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:03,444 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2025-01-09 22:36:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 22:36:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:03,445 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:36:03,445 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:36:03,446 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-01-09 22:36:03,446 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 339 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-01-09 22:36:03,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 339 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:36:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-09 22:36:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 169 states have internal predecessors, (183), 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-01-09 22:36:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2025-01-09 22:36:03,449 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 29 [2025-01-09 22:36:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:03,449 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2025-01-09 22:36:03,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2025-01-09 22:36:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:36:03,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:03,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:03,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:36:03,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:03,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1721060717, now seen corresponding path program 1 times [2025-01-09 22:36:03,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812688033] [2025-01-09 22:36:03,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:36:03,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:36:03,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:03,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812688033] [2025-01-09 22:36:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812688033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793643903] [2025-01-09 22:36:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:36:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:36:03,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:03,592 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:03,716 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2025-01-09 22:36:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:03,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 22:36:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:03,717 INFO L225 Difference]: With dead ends: 170 [2025-01-09 22:36:03,717 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 22:36:03,717 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-01-09 22:36:03,717 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:03,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 22:36:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 22:36:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 135 states have (on average 1.348148148148148) internal successors, (182), 168 states have internal predecessors, (182), 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-01-09 22:36:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2025-01-09 22:36:03,723 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 29 [2025-01-09 22:36:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:03,723 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2025-01-09 22:36:03,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2025-01-09 22:36:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:36:03,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:03,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:03,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:36:03,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -750864776, now seen corresponding path program 1 times [2025-01-09 22:36:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:03,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536864038] [2025-01-09 22:36:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:03,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:36:03,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:36:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536864038] [2025-01-09 22:36:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536864038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419585540] [2025-01-09 22:36:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:03,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:36:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:03,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:36:03,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:36:03,853 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-01-09 22:36:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:03,964 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2025-01-09 22:36:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:36:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2025-01-09 22:36:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:03,965 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:36:03,965 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:36:03,966 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-01-09 22:36:03,966 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 12 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:03,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 261 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:36:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-01-09 22:36:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 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-01-09 22:36:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2025-01-09 22:36:03,969 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 32 [2025-01-09 22:36:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2025-01-09 22:36:03,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-01-09 22:36:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2025-01-09 22:36:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:36:03,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:03,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:03,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:36:03,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1952271529, now seen corresponding path program 1 times [2025-01-09 22:36:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:03,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440645996] [2025-01-09 22:36:03,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:03,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:36:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:36:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:04,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:04,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440645996] [2025-01-09 22:36:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440645996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:04,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385199867] [2025-01-09 22:36:04,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:04,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:04,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:04,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:04,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:36:04,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:36:04,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:36:04,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:04,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:04,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:36:04,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:04,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:36:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385199867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:04,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:36:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-01-09 22:36:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692869026] [2025-01-09 22:36:04,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:04,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:04,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:04,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:04,163 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:04,204 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2025-01-09 22:36:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 22:36:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:04,204 INFO L225 Difference]: With dead ends: 170 [2025-01-09 22:36:04,204 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 22:36:04,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:04,205 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:04,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 135 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:36:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 22:36:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 22:36:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3235294117647058) internal successors, (180), 168 states have internal predecessors, (180), 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-01-09 22:36:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2025-01-09 22:36:04,207 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 31 [2025-01-09 22:36:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2025-01-09 22:36:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2025-01-09 22:36:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:36:04,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:04,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:04,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:36:04,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:04,409 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:04,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -83938643, now seen corresponding path program 1 times [2025-01-09 22:36:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055187199] [2025-01-09 22:36:04,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:36:04,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:36:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055187199] [2025-01-09 22:36:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055187199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:36:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255759182] [2025-01-09 22:36:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:36:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:04,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:36:04,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:36:04,641 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-01-09 22:36:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:05,000 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2025-01-09 22:36:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:36:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 34 [2025-01-09 22:36:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:05,001 INFO L225 Difference]: With dead ends: 201 [2025-01-09 22:36:05,001 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 22:36:05,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:36:05,002 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 331 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:05,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 293 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 22:36:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2025-01-09 22:36:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 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-01-09 22:36:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2025-01-09 22:36:05,017 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 34 [2025-01-09 22:36:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:05,017 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2025-01-09 22:36:05,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-01-09 22:36:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2025-01-09 22:36:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:36:05,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:05,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:36:05,018 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1461421228, now seen corresponding path program 1 times [2025-01-09 22:36:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92522359] [2025-01-09 22:36:05,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:05,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:36:05,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:36:05,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:05,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:05,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92522359] [2025-01-09 22:36:05,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92522359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:05,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:05,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:36:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255685734] [2025-01-09 22:36:05,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:05,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:36:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:05,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:36:05,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:36:05,227 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:05,439 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2025-01-09 22:36:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:36:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 22:36:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:05,440 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:36:05,440 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:36:05,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:36:05,440 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:05,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 338 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:36:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-01-09 22:36:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 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-01-09 22:36:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2025-01-09 22:36:05,443 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 33 [2025-01-09 22:36:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:05,443 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2025-01-09 22:36:05,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2025-01-09 22:36:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:36:05,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:05,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:05,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:36:05,444 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1461421227, now seen corresponding path program 1 times [2025-01-09 22:36:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076810603] [2025-01-09 22:36:05,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:05,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:36:05,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:36:05,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:05,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076810603] [2025-01-09 22:36:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076810603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:36:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032953548] [2025-01-09 22:36:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:05,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:36:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:05,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:36:05,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:05,681 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:05,951 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2025-01-09 22:36:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:36:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 22:36:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:05,952 INFO L225 Difference]: With dead ends: 165 [2025-01-09 22:36:05,952 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 22:36:05,952 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-01-09 22:36:05,953 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:05,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 461 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 22:36:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2025-01-09 22:36:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.2698412698412698) 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-01-09 22:36:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2025-01-09 22:36:05,956 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 33 [2025-01-09 22:36:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:05,956 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2025-01-09 22:36:05,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2025-01-09 22:36:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:36:05,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:05,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:05,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:36:05,957 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:05,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash -767758804, now seen corresponding path program 1 times [2025-01-09 22:36:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851414184] [2025-01-09 22:36:05,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:36:05,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:36:05,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:05,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:06,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851414184] [2025-01-09 22:36:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851414184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469335897] [2025-01-09 22:36:06,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:06,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:06,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:06,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:06,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:36:06,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:36:06,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:36:06,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:06,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:06,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:36:06,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:06,199 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-01-09 22:36:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:06,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:36:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469335897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:06,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:36:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2025-01-09 22:36:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579344001] [2025-01-09 22:36:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:06,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:36:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:06,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:36:06,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:06,235 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:06,313 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2025-01-09 22:36:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:36:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 22:36:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:06,315 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:36:06,315 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:36:06,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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-01-09 22:36:06,315 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 6 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:06,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 292 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:36:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2025-01-09 22:36:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 153 states have internal predecessors, (163), 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-01-09 22:36:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2025-01-09 22:36:06,319 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 33 [2025-01-09 22:36:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:06,319 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2025-01-09 22:36:06,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2025-01-09 22:36:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:36:06,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:06,320 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] [2025-01-09 22:36:06,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:36:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:06,521 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash 357482104, now seen corresponding path program 1 times [2025-01-09 22:36:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712452823] [2025-01-09 22:36:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:36:06,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:36:06,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:06,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712452823] [2025-01-09 22:36:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712452823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950912011] [2025-01-09 22:36:06,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:06,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:06,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:36:06,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:36:06,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:36:06,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:06,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:36:06,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:06,753 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-01-09 22:36:06,787 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:36:06,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-01-09 22:36:06,811 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-01-09 22:36:06,841 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-01-09 22:36:06,876 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-01-09 22:36:07,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:07,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2025-01-09 22:36:07,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:36:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:07,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950912011] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:07,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2025-01-09 22:36:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627576889] [2025-01-09 22:36:07,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:07,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:36:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:07,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:36:07,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:36:07,392 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 20 states, 20 states have (on average 4.5) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:08,343 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2025-01-09 22:36:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:36:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.5) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 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 34 [2025-01-09 22:36:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:08,344 INFO L225 Difference]: With dead ends: 182 [2025-01-09 22:36:08,344 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 22:36:08,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:36:08,346 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 425 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:08,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 609 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:36:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 22:36:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2025-01-09 22:36:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.2571428571428571) internal successors, (176), 164 states have internal predecessors, (176), 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-01-09 22:36:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-01-09 22:36:08,350 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 34 [2025-01-09 22:36:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-01-09 22:36:08,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.5) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-01-09 22:36:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:36:08,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:08,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:08,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:36:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 22:36:08,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:08,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1802915676, now seen corresponding path program 1 times [2025-01-09 22:36:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:08,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793163575] [2025-01-09 22:36:08,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:36:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:36:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793163575] [2025-01-09 22:36:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793163575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:36:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535977696] [2025-01-09 22:36:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:08,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:08,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:08,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:08,589 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:08,621 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2025-01-09 22:36:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:08,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 22:36:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:08,625 INFO L225 Difference]: With dead ends: 165 [2025-01-09 22:36:08,625 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 22:36:08,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:08,626 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 75 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:08,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 92 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:36:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 22:36:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-01-09 22:36:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 163 states have internal predecessors, (174), 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-01-09 22:36:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2025-01-09 22:36:08,630 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 35 [2025-01-09 22:36:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2025-01-09 22:36:08,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2025-01-09 22:36:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:36:08,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:08,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:08,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:36:08,631 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:08,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1730133177, now seen corresponding path program 1 times [2025-01-09 22:36:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:08,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602768578] [2025-01-09 22:36:08,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:08,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:08,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:08,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:08,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:08,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602768578] [2025-01-09 22:36:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602768578] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966613936] [2025-01-09 22:36:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:08,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:08,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:36:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:08,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:08,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:08,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:08,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:36:08,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:08,942 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:36:08,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-01-09 22:36:09,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2025-01-09 22:36:09,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 21 treesize of output 37 [2025-01-09 22:36:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:09,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:36:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966613936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:09,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-01-09 22:36:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247704809] [2025-01-09 22:36:09,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:09,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:36:09,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:09,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:36:09,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:36:09,337 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:09,661 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2025-01-09 22:36:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:36:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 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 37 [2025-01-09 22:36:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:09,662 INFO L225 Difference]: With dead ends: 176 [2025-01-09 22:36:09,662 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 22:36:09,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:36:09,662 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 12 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:09,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 472 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:36:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 22:36:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2025-01-09 22:36:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.264) internal successors, (158), 148 states have internal predecessors, (158), 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-01-09 22:36:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2025-01-09 22:36:09,665 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 37 [2025-01-09 22:36:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2025-01-09 22:36:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2025-01-09 22:36:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:36:09,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:09,666 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] [2025-01-09 22:36:09,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:36:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:36:09,867 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:09,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1660434623, now seen corresponding path program 1 times [2025-01-09 22:36:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209068108] [2025-01-09 22:36:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:09,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:36:09,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:36:09,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:09,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:10,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209068108] [2025-01-09 22:36:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209068108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527701832] [2025-01-09 22:36:10,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:10,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:10,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:36:10,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:36:10,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:36:10,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:10,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:10,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 22:36:10,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:10,472 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-01-09 22:36:10,504 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-01-09 22:36:10,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:10,559 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-01-09 22:36:10,584 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-01-09 22:36:10,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:10,589 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 23 treesize of output 11 [2025-01-09 22:36:10,657 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:10,657 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-01-09 22:36:10,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 24 treesize of output 11 [2025-01-09 22:36:10,674 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-01-09 22:36:10,709 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-01-09 22:36:10,722 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-01-09 22:36:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:10,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:10,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-01-09 22:36:10,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-01-09 22:36:10,835 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (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_1574) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-01-09 22:36:10,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1570) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1571) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-01-09 22:36:10,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int)) (v_ArrVal_1570 (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_1570) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1571) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1574)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-01-09 22:36:10,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:10,858 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-01-09 22:36:10,860 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-01-09 22:36:10,864 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-01-09 22:36:10,901 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#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|))) (and (or .cse0 (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (or (not (= v_ArrVal_1568 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1568 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_1568 (Array Int Int))) (or (forall ((v_ArrVal_1574 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1568))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_arrayElimCell_29 Int) (v_ArrVal_1570 (Array Int Int))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1570) v_arrayElimCell_29 v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= v_ArrVal_1568 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1568 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or (not .cse0) (forall ((v_ArrVal_1568 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1570) v_arrayElimCell_29 v_ArrVal_1574) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_1568 (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1568 |c_ULTIMATE.start_main_~end~0#1.offset|))))))))) is different from false [2025-01-09 22:36:13,708 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 165 treesize of output 163 [2025-01-09 22:36:13,714 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 25 [2025-01-09 22:36:13,723 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:13,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:36:13,729 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:13,730 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 22 [2025-01-09 22:36:13,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:13,734 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:13,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-01-09 22:36:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527701832] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:13,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2025-01-09 22:36:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617256369] [2025-01-09 22:36:13,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:13,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:36:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:13,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:36:13,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=723, Unknown=10, NotChecked=366, Total=1260 [2025-01-09 22:36:13,760 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 36 states, 36 states have (on average 3.0277777777777777) internal successors, (109), 36 states have internal predecessors, (109), 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-01-09 22:36:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:16,300 INFO L93 Difference]: Finished difference Result 232 states and 253 transitions. [2025-01-09 22:36:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:36:16,301 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0277777777777777) internal successors, (109), 36 states have internal predecessors, (109), 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 42 [2025-01-09 22:36:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:16,301 INFO L225 Difference]: With dead ends: 232 [2025-01-09 22:36:16,301 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 22:36:16,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=470, Invalid=1611, Unknown=13, NotChecked=558, Total=2652 [2025-01-09 22:36:16,302 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 605 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 64 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1188 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:16,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 704 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1022 Invalid, 8 Unknown, 1188 Unchecked, 0.7s Time] [2025-01-09 22:36:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 22:36:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 177. [2025-01-09 22:36:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 152 states have (on average 1.230263157894737) internal successors, (187), 175 states have internal predecessors, (187), 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-01-09 22:36:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2025-01-09 22:36:16,306 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 42 [2025-01-09 22:36:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:16,306 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2025-01-09 22:36:16,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0277777777777777) internal successors, (109), 36 states have internal predecessors, (109), 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-01-09 22:36:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2025-01-09 22:36:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:36:16,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:16,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:16,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:36:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 22:36:16,507 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash 45587128, now seen corresponding path program 1 times [2025-01-09 22:36:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:16,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795930158] [2025-01-09 22:36:16,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:16,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:36:16,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:36:16,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:16,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:16,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795930158] [2025-01-09 22:36:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795930158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 22:36:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156343718] [2025-01-09 22:36:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:36:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:16,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:36:16,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:36:16,925 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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-01-09 22:36:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:17,398 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2025-01-09 22:36:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:36:17,398 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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 44 [2025-01-09 22:36:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:17,399 INFO L225 Difference]: With dead ends: 188 [2025-01-09 22:36:17,399 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 22:36:17,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:36:17,400 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 211 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:17,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 584 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:36:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 22:36:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2025-01-09 22:36:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 167 states have internal predecessors, (179), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2025-01-09 22:36:17,404 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 44 [2025-01-09 22:36:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2025-01-09 22:36:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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-01-09 22:36:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2025-01-09 22:36:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:36:17,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:17,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:36:17,405 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:17,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1440659757, now seen corresponding path program 1 times [2025-01-09 22:36:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626669698] [2025-01-09 22:36:17,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:17,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:36:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:36:17,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626669698] [2025-01-09 22:36:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626669698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621683343] [2025-01-09 22:36:17,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:17,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:17,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:17,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:17,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:36:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:36:17,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:36:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:17,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:36:17,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:17,851 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-01-09 22:36:17,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:17,909 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-01-09 22:36:17,937 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-01-09 22:36:17,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:17,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-09 22:36:18,050 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:18,050 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-01-09 22:36:18,093 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:18,094 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-01-09 22:36:18,200 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-01-09 22:36:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:18,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:18,392 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-01-09 22:36:18,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:36:18,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_85| Int) (v_ArrVal_1804 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1802))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1804) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|) .cse1))) (< |v_ULTIMATE.start_main_~end~0#1.offset_85| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_85|))) is different from false [2025-01-09 22:36:18,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:18,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2025-01-09 22:36:18,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:18,566 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 256 treesize of output 195 [2025-01-09 22:36:18,572 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 92 treesize of output 86 [2025-01-09 22:36:18,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:18,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 55 [2025-01-09 22:36:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621683343] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:18,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2025-01-09 22:36:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590263383] [2025-01-09 22:36:18,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:36:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:18,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:36:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1065, Unknown=14, NotChecked=66, Total=1260 [2025-01-09 22:36:18,853 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 36 states, 35 states have (on average 3.5714285714285716) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:19,835 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2025-01-09 22:36:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:36:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.5714285714285716) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 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 47 [2025-01-09 22:36:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:19,836 INFO L225 Difference]: With dead ends: 258 [2025-01-09 22:36:19,836 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 22:36:19,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=1786, Unknown=14, NotChecked=88, Total=2162 [2025-01-09 22:36:19,837 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 774 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:19,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 812 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1584 Invalid, 0 Unknown, 212 Unchecked, 0.7s Time] [2025-01-09 22:36:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 22:36:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2025-01-09 22:36:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 180 states have (on average 1.211111111111111) internal successors, (218), 202 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2025-01-09 22:36:19,840 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 47 [2025-01-09 22:36:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:19,840 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2025-01-09 22:36:19,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.5714285714285716) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2025-01-09 22:36:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:36:19,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:19,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:19,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:36:20,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:20,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1440659756, now seen corresponding path program 1 times [2025-01-09 22:36:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711467106] [2025-01-09 22:36:20,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:20,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:36:20,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:36:20,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:20,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711467106] [2025-01-09 22:36:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711467106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49865844] [2025-01-09 22:36:20,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:20,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:20,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:20,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:36:20,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:36:20,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:36:20,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:20,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:20,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:36:20,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:20,551 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-01-09 22:36:20,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:20,602 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-01-09 22:36:20,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:36:20,631 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-01-09 22:36:20,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:20,700 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:20,701 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-01-09 22:36:20,706 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-01-09 22:36:20,790 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:20,790 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-01-09 22:36:20,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:20,795 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-01-09 22:36:20,834 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:20,834 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-01-09 22:36:20,840 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-01-09 22:36:20,995 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-01-09 22:36:20,998 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-01-09 22:36:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:21,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:21,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:21,906 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 162 treesize of output 139 [2025-01-09 22:36:21,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:21,914 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 130 treesize of output 107 [2025-01-09 22:36:21,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:21,924 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 414 treesize of output 377 [2025-01-09 22:36:21,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:21,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 633 treesize of output 619 [2025-01-09 22:36:21,977 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 331 treesize of output 323 [2025-01-09 22:36:21,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:21,991 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 323 treesize of output 314 [2025-01-09 22:36:21,999 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 305 treesize of output 297 [2025-01-09 22:36:22,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:22,016 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 297 treesize of output 300 [2025-01-09 22:36:22,024 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 291 treesize of output 283 [2025-01-09 22:36:22,033 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 283 treesize of output 277 [2025-01-09 22:36:22,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:22,048 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 277 treesize of output 282 [2025-01-09 22:36:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49865844] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:23,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2025-01-09 22:36:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807924037] [2025-01-09 22:36:23,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:23,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 22:36:23,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:23,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 22:36:23,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1411, Unknown=25, NotChecked=0, Total=1560 [2025-01-09 22:36:23,173 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand has 40 states, 39 states have (on average 3.358974358974359) internal successors, (131), 40 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:24,533 INFO L93 Difference]: Finished difference Result 261 states and 284 transitions. [2025-01-09 22:36:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:36:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.358974358974359) internal successors, (131), 40 states have internal predecessors, (131), 0 states have call successors, (0), 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 47 [2025-01-09 22:36:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:24,534 INFO L225 Difference]: With dead ends: 261 [2025-01-09 22:36:24,534 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 22:36:24,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=345, Invalid=2599, Unknown=26, NotChecked=0, Total=2970 [2025-01-09 22:36:24,536 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 892 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:24,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1070 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 22:36:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 22:36:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 207. [2025-01-09 22:36:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 205 states have internal predecessors, (221), 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-01-09 22:36:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2025-01-09 22:36:24,538 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 47 [2025-01-09 22:36:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:24,539 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2025-01-09 22:36:24,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.358974358974359) internal successors, (131), 40 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2025-01-09 22:36:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:36:24,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:24,539 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, 1, 1, 1, 1, 1] [2025-01-09 22:36:24,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:36:24,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:24,740 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-09 22:36:24,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1589208522, now seen corresponding path program 1 times [2025-01-09 22:36:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500893573] [2025-01-09 22:36:24,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:24,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:36:24,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:36:24,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:24,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500893573] [2025-01-09 22:36:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500893573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274788944] [2025-01-09 22:36:25,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:25,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:25,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:36:25,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:36:25,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:36:25,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:36:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:25,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:36:25,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:25,594 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-01-09 22:36:25,613 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-01-09 22:36:25,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:25,667 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-01-09 22:36:25,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:25,685 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 23 treesize of output 11 [2025-01-09 22:36:25,689 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-01-09 22:36:25,745 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:25,745 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-01-09 22:36:25,747 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-01-09 22:36:25,758 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-01-09 22:36:25,792 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-01-09 22:36:25,817 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-01-09 22:36:25,836 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:25,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:25,862 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:25,865 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-01-09 22:36:25,871 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-01-09 22:36:25,932 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:25,933 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 57 treesize of output 50 [2025-01-09 22:36:25,935 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 24 treesize of output 11 [2025-01-09 22:36:25,945 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 22:36:25,945 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 1 case distinctions, treesize of input 24 treesize of output 19 [2025-01-09 22:36:25,990 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 31 treesize of output 19 [2025-01-09 22:36:25,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-01-09 22:36:26,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:36:26,039 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 20 treesize of output 19 [2025-01-09 22:36:26,069 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 22:36:26,069 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 23 treesize of output 26 [2025-01-09 22:36:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:26,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:26,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:26,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:36:26,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:26,487 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-01-09 22:36:26,490 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-01-09 22:36:26,494 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-01-09 22:36:26,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:26,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:36:26,508 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 29 treesize of output 21 [2025-01-09 22:36:26,512 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 9 [2025-01-09 22:36:27,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:27,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 103 [2025-01-09 22:36:27,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2144))) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_21 |c_ULTIMATE.start_main_~end~0#1.base|) (not (= (select v_prenex_20 8) 1)))))) is different from false [2025-01-09 22:36:27,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem6#1.base| v_prenex_21) (not (= (select v_prenex_20 8) 1)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem6#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2144))) (or (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~mem6#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) is different from false [2025-01-09 22:36:27,241 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| .cse0 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= .cse0 v_prenex_21) (not (= (select v_prenex_20 8) 1)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| .cse0 v_ArrVal_2144))) (or (= .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) is different from false [2025-01-09 22:36:27,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2139) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2138) .cse0 v_ArrVal_2144))) (or (not (= (select v_arrayElimArr_5 8) 1)) (= .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2139) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2138) .cse3 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= .cse3 v_prenex_21) (not (= (select v_prenex_20 8) 1))))))) is different from false [2025-01-09 22:36:27,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_2139) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_int#1| .cse3 v_ArrVal_2138) .cse0 v_ArrVal_2144))) (or (= .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_2139) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse3 v_ArrVal_2138) .cse4 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1)) (= .cse4 v_prenex_21)))))) is different from false [2025-01-09 22:36:27,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:27,320 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 162 treesize of output 131 [2025-01-09 22:36:27,324 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 243 treesize of output 219 [2025-01-09 22:36:27,328 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 205 treesize of output 199 [2025-01-09 22:36:27,332 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 199 treesize of output 195 [2025-01-09 22:36:27,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (not .cse0)) (.cse2 (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 .cse0 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_prenex_20 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or .cse3 (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse5 (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_21 v_arrayElimCell_99) (not (= (select v_prenex_20 8) 1)))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_99 Int)) (or (= v_prenex_21 v_arrayElimCell_99) (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_20 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse3) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse0) (or .cse3 (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))))))))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse0) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_arrayElimCell_99 Int)) (or (= v_prenex_21 v_arrayElimCell_99) (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_20 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse3 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2135 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse21 (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (or .cse3 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_21 v_arrayElimCell_99) (not (= (select v_prenex_20 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2135 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) .cse0)))) is different from false [2025-01-09 22:36:39,260 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,264 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 165 treesize of output 163 [2025-01-09 22:36:39,270 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 25 [2025-01-09 22:36:39,277 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,287 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,287 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 14 treesize of output 11 [2025-01-09 22:36:39,293 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 936 treesize of output 934 [2025-01-09 22:36:39,311 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:39,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 227 [2025-01-09 22:36:39,341 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 43 treesize of output 39 [2025-01-09 22:36:39,348 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 115 treesize of output 99 [2025-01-09 22:36:39,355 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 54 treesize of output 46 [2025-01-09 22:36:39,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,408 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 97 treesize of output 95 [2025-01-09 22:36:39,417 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,417 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 75 treesize of output 64 [2025-01-09 22:36:39,425 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:36:39,432 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,433 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 40 treesize of output 38 [2025-01-09 22:36:39,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,444 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,444 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 14 treesize of output 11 [2025-01-09 22:36:39,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,448 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 40 treesize of output 38 [2025-01-09 22:36:39,452 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,459 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,459 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 14 treesize of output 11 [2025-01-09 22:36:39,462 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,465 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 222 treesize of output 220 [2025-01-09 22:36:39,476 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,476 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 103 treesize of output 84 [2025-01-09 22:36:39,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:36:39,496 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,499 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 97 treesize of output 95 [2025-01-09 22:36:39,510 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,510 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 75 treesize of output 64 [2025-01-09 22:36:39,516 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 20 [2025-01-09 22:36:39,522 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,530 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,533 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 165 treesize of output 163 [2025-01-09 22:36:39,539 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 25 [2025-01-09 22:36:39,546 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:39,553 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:36:39,554 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 14 treesize of output 11 [2025-01-09 22:36:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274788944] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:44,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:44,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 59 [2025-01-09 22:36:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483978897] [2025-01-09 22:36:44,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:44,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 22:36:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:44,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 22:36:44,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2380, Unknown=23, NotChecked=642, Total=3422 [2025-01-09 22:36:44,234 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand has 59 states, 59 states have (on average 2.3559322033898304) internal successors, (139), 59 states have internal predecessors, (139), 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-01-09 22:36:46,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (not .cse1)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int)) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_97|) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 8)) 1)) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0))) (or .cse1 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_prenex_20 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 1) (or .cse3 (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse5 (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= v_prenex_21 v_arrayElimCell_99) (not (= (select v_prenex_20 8) 1)))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_99 Int)) (or (= v_prenex_21 v_arrayElimCell_99) (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (= (select (select (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (not (= (select v_prenex_20 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse3) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse1) (or .cse3 (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))))))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))))))))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse1) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_arrayElimCell_99 Int)) (or (= v_prenex_21 v_arrayElimCell_99) (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (not (= (select v_prenex_20 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse3 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2135 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse21 (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (or .cse3 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= v_prenex_21 v_arrayElimCell_99) (not (= (select v_prenex_20 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2135 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) .cse1) (= (select .cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1)))) is different from false [2025-01-09 22:36:46,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1)) (.cse15 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse4 (not .cse1)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int)) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_97|) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 8)) 1)) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0))) (or .cse1 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_prenex_20 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 1) (or .cse4 (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse6 (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= v_prenex_21 v_arrayElimCell_99) (not (= (select v_prenex_20 8) 1)))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_99 Int)) (or (= v_prenex_21 v_arrayElimCell_99) (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (not (= (select v_prenex_20 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse4) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse1) (or .cse4 (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1))))))))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))))))))))) (not .cse15) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (forall ((v_arrayElimCell_98 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (or .cse3 .cse15) (or (and (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (forall ((v_ArrVal_2144 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int)) (= (select (select (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= (select v_arrayElimArr_5 8) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse1) (= (select .cse2 8) 1) (forall ((v_ArrVal_2135 (Array Int Int))) (or (forall ((v_prenex_21 Int)) (or (forall ((v_arrayElimCell_99 Int)) (or (= v_prenex_21 v_arrayElimCell_99) (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (or (forall ((v_prenex_28 (Array Int Int))) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (not (= (select v_prenex_20 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21))) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse4 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2135 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135))) (let ((.cse23 (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2138) v_arrayElimCell_98 v_ArrVal_2144))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144) |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimCell_98) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) (or .cse4 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2135 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_28) v_arrayElimCell_99 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= v_prenex_21 v_arrayElimCell_99) (not (= (select v_prenex_20 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_arrayElimCell_91 Int) (v_ArrVal_2135 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_10| Int) (v_ArrVal_2144 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2144))) (or (= (select (select (store .cse24 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_10|) (not (= v_ArrVal_2135 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2135 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc8#1.base_10| v_ArrVal_2148) v_arrayElimCell_91 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) .cse1)))) is different from false [2025-01-09 22:36:47,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:36:53,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:36:57,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:02,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:03,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int))) (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|))) (or (= (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2148) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2147) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 8)) 1)) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2146) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_97|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2146) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_97|) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 8)) 1)) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2148) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) is different from false [2025-01-09 22:37:07,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:12,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:16,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:21,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:26,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]