./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:30:40,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:30:40,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:30:40,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:30:40,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:30:40,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:30:40,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:30:40,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:30:40,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:30:40,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:30:40,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:30:40,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:30:40,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:30:40,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:30:40,811 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:30:40,812 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:30:40,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:30:40,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:30:40,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:30:40,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:30:40,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:30:40,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:30:40,815 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-09 00:30:41,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:30:41,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:30:41,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:30:41,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:30:41,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:30:41,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2025-03-09 00:30:42,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00934be59/266cf863d8a94b0caefce5c3b66dbcf8/FLAG746743f3c [2025-03-09 00:30:42,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:30:42,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2025-03-09 00:30:42,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00934be59/266cf863d8a94b0caefce5c3b66dbcf8/FLAG746743f3c [2025-03-09 00:30:42,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00934be59/266cf863d8a94b0caefce5c3b66dbcf8 [2025-03-09 00:30:42,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:30:42,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:30:42,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:30:42,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:30:42,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:30:42,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:30:42" (1/1) ... [2025-03-09 00:30:42,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:42, skipping insertion in model container [2025-03-09 00:30:42,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:30:42" (1/1) ... [2025-03-09 00:30:42,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:30:43,050 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:43,069 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:43,072 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:43,074 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:43,080 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:43,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:30:43,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:30:43,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:30:43,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:30:43,207 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:30:43,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43 WrapperNode [2025-03-09 00:30:43,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:30:43,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:30:43,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:30:43,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:30:43,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,254 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-09 00:30:43,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:30:43,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:30:43,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:30:43,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:30:43,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,302 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-09 00:30:43,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:30:43,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:30:43,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:30:43,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:30:43,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (1/1) ... [2025-03-09 00:30:43,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:30:43,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:43,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:30:43,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:30:43,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:30:43,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:30:43,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:30:43,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:30:43,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:30:44,830 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2025-03-09 00:30:44,830 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:30:44,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:30:44,881 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 00:30:44,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:30:44 BoogieIcfgContainer [2025-03-09 00:30:44,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:30:44,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:30:44,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:30:44,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:30:44,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:30:42" (1/3) ... [2025-03-09 00:30:44,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd25714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:30:44, skipping insertion in model container [2025-03-09 00:30:44,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:30:43" (2/3) ... [2025-03-09 00:30:44,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd25714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:30:44, skipping insertion in model container [2025-03-09 00:30:44,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:30:44" (3/3) ... [2025-03-09 00:30:44,890 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2025-03-09 00:30:44,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:30:44,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-1.i that has 3 procedures, 737 locations, 1 initial locations, 19 loop locations, and 320 error locations. [2025-03-09 00:30:44,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:30:44,953 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;@77c6262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:30:44,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-03-09 00:30:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 732 states, 410 states have (on average 2.0658536585365854) internal successors, (847), 727 states have internal predecessors, (847), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:30:44,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:44,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:30:44,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash 864568488, now seen corresponding path program 1 times [2025-03-09 00:30:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:44,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105743405] [2025-03-09 00:30:44,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:30:45,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:30:45,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:45,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105743405] [2025-03-09 00:30:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105743405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:30:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889149675] [2025-03-09 00:30:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:30:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:45,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:30:45,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:30:45,102 INFO L87 Difference]: Start difference. First operand has 732 states, 410 states have (on average 2.0658536585365854) internal successors, (847), 727 states have internal predecessors, (847), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:45,187 INFO L93 Difference]: Finished difference Result 722 states and 810 transitions. [2025-03-09 00:30:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:30:45,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:30:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:45,197 INFO L225 Difference]: With dead ends: 722 [2025-03-09 00:30:45,198 INFO L226 Difference]: Without dead ends: 720 [2025-03-09 00:30:45,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:30:45,201 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:45,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 788 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-09 00:30:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-03-09 00:30:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 404 states have (on average 1.9851485148514851) internal successors, (802), 715 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 808 transitions. [2025-03-09 00:30:45,273 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 808 transitions. Word has length 5 [2025-03-09 00:30:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:45,273 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 808 transitions. [2025-03-09 00:30:45,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 808 transitions. [2025-03-09 00:30:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:30:45,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:45,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:30:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:30:45,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:45,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 864568519, now seen corresponding path program 1 times [2025-03-09 00:30:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624913029] [2025-03-09 00:30:45,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:45,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:30:45,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:30:45,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:45,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:45,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624913029] [2025-03-09 00:30:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624913029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:30:45,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777477380] [2025-03-09 00:30:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:45,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:45,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:45,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:45,367 INFO L87 Difference]: Start difference. First operand 720 states and 808 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:45,851 INFO L93 Difference]: Finished difference Result 672 states and 761 transitions. [2025-03-09 00:30:45,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:30:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:45,854 INFO L225 Difference]: With dead ends: 672 [2025-03-09 00:30:45,855 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 00:30:45,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:45,855 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 674 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:45,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 436 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:30:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 00:30:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 671. [2025-03-09 00:30:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 404 states have (on average 1.863861386138614) internal successors, (753), 666 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 759 transitions. [2025-03-09 00:30:45,876 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 759 transitions. Word has length 5 [2025-03-09 00:30:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:45,876 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 759 transitions. [2025-03-09 00:30:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 759 transitions. [2025-03-09 00:30:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:30:45,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:45,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:30:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:30:45,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 864568520, now seen corresponding path program 1 times [2025-03-09 00:30:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389537030] [2025-03-09 00:30:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:45,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:30:45,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:30:45,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:45,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389537030] [2025-03-09 00:30:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389537030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:30:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142101982] [2025-03-09 00:30:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:45,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:45,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:45,963 INFO L87 Difference]: Start difference. First operand 671 states and 759 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:46,383 INFO L93 Difference]: Finished difference Result 747 states and 841 transitions. [2025-03-09 00:30:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:30:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:46,387 INFO L225 Difference]: With dead ends: 747 [2025-03-09 00:30:46,387 INFO L226 Difference]: Without dead ends: 747 [2025-03-09 00:30:46,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:46,391 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 413 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:46,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 793 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:30:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-09 00:30:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 700. [2025-03-09 00:30:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 444 states have (on average 1.8490990990990992) internal successors, (821), 695 states have internal predecessors, (821), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 827 transitions. [2025-03-09 00:30:46,407 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 827 transitions. Word has length 5 [2025-03-09 00:30:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:46,407 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 827 transitions. [2025-03-09 00:30:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 827 transitions. [2025-03-09 00:30:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:30:46,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:46,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:30:46,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:30:46,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:46,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 863731421, now seen corresponding path program 1 times [2025-03-09 00:30:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454899783] [2025-03-09 00:30:46,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:46,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:30:46,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:30:46,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:46,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454899783] [2025-03-09 00:30:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454899783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255478032] [2025-03-09 00:30:46,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:46,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:46,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:46,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:46,445 INFO L87 Difference]: Start difference. First operand 700 states and 827 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:46,517 INFO L93 Difference]: Finished difference Result 1378 states and 1631 transitions. [2025-03-09 00:30:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 00:30:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:46,522 INFO L225 Difference]: With dead ends: 1378 [2025-03-09 00:30:46,522 INFO L226 Difference]: Without dead ends: 1378 [2025-03-09 00:30:46,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:46,523 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 718 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:46,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1668 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-09 00:30:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 701. [2025-03-09 00:30:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 445 states have (on average 1.847191011235955) internal successors, (822), 696 states have internal predecessors, (822), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 828 transitions. [2025-03-09 00:30:46,540 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 828 transitions. Word has length 5 [2025-03-09 00:30:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:46,540 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 828 transitions. [2025-03-09 00:30:46,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 828 transitions. [2025-03-09 00:30:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:30:46,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:46,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:30:46,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:46,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -413060841, now seen corresponding path program 1 times [2025-03-09 00:30:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351370964] [2025-03-09 00:30:46,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:46,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:30:46,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:30:46,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:46,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:46,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:46,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351370964] [2025-03-09 00:30:46,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351370964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:46,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165544019] [2025-03-09 00:30:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:46,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:30:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:46,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:30:46,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:30:46,621 INFO L87 Difference]: Start difference. First operand 701 states and 828 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-03-09 00:30:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:47,083 INFO L93 Difference]: Finished difference Result 727 states and 881 transitions. [2025-03-09 00:30:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:30:47,084 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-03-09 00:30:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:47,086 INFO L225 Difference]: With dead ends: 727 [2025-03-09 00:30:47,087 INFO L226 Difference]: Without dead ends: 727 [2025-03-09 00:30:47,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:47,089 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 938 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:47,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 685 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:30:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-09 00:30:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 678. [2025-03-09 00:30:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 445 states have (on average 1.7955056179775282) internal successors, (799), 673 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 805 transitions. [2025-03-09 00:30:47,109 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 805 transitions. Word has length 14 [2025-03-09 00:30:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:47,110 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 805 transitions. [2025-03-09 00:30:47,110 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-03-09 00:30:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 805 transitions. [2025-03-09 00:30:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:30:47,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:47,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:47,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:30:47,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash -413060840, now seen corresponding path program 1 times [2025-03-09 00:30:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94446461] [2025-03-09 00:30:47,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:47,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:30:47,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:30:47,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:47,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:47,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:47,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94446461] [2025-03-09 00:30:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94446461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610075802] [2025-03-09 00:30:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:47,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:30:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:47,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:30:47,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:30:47,270 INFO L87 Difference]: Start difference. First operand 678 states and 805 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-03-09 00:30:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:47,791 INFO L93 Difference]: Finished difference Result 827 states and 1021 transitions. [2025-03-09 00:30:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:30:47,791 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-03-09 00:30:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:47,794 INFO L225 Difference]: With dead ends: 827 [2025-03-09 00:30:47,794 INFO L226 Difference]: Without dead ends: 827 [2025-03-09 00:30:47,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:47,795 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 873 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:47,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1046 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:30:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-09 00:30:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 680. [2025-03-09 00:30:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 462 states have (on average 1.6753246753246753) internal successors, (774), 675 states have internal predecessors, (774), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 780 transitions. [2025-03-09 00:30:47,808 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 780 transitions. Word has length 14 [2025-03-09 00:30:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:47,808 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 780 transitions. [2025-03-09 00:30:47,808 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-03-09 00:30:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 780 transitions. [2025-03-09 00:30:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:30:47,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:47,810 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] [2025-03-09 00:30:47,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:30:47,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1496352508, now seen corresponding path program 1 times [2025-03-09 00:30:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895682398] [2025-03-09 00:30:47,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:47,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:30:47,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:30:47,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:47,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:30:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895682398] [2025-03-09 00:30:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895682398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:48,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451390853] [2025-03-09 00:30:48,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:48,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:48,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:48,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:48,017 INFO L87 Difference]: Start difference. First operand 680 states and 780 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:48,058 INFO L93 Difference]: Finished difference Result 537 states and 597 transitions. [2025-03-09 00:30:48,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-09 00:30:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:48,060 INFO L225 Difference]: With dead ends: 537 [2025-03-09 00:30:48,061 INFO L226 Difference]: Without dead ends: 537 [2025-03-09 00:30:48,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:48,061 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 50 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:48,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1101 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-09 00:30:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-09 00:30:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 342 states have (on average 1.7280701754385965) internal successors, (591), 532 states have internal predecessors, (591), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 597 transitions. [2025-03-09 00:30:48,072 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 597 transitions. Word has length 51 [2025-03-09 00:30:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:48,072 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 597 transitions. [2025-03-09 00:30:48,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 597 transitions. [2025-03-09 00:30:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:30:48,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:48,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:48,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:30:48,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1163163272, now seen corresponding path program 1 times [2025-03-09 00:30:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028087878] [2025-03-09 00:30:48,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:48,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:30:48,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:30:48,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:48,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028087878] [2025-03-09 00:30:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028087878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:48,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:30:48,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727948638] [2025-03-09 00:30:48,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:30:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:48,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:30:48,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:30:48,220 INFO L87 Difference]: Start difference. First operand 537 states and 597 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:48,312 INFO L93 Difference]: Finished difference Result 550 states and 606 transitions. [2025-03-09 00:30:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:30:48,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-09 00:30:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:48,315 INFO L225 Difference]: With dead ends: 550 [2025-03-09 00:30:48,315 INFO L226 Difference]: Without dead ends: 550 [2025-03-09 00:30:48,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:48,315 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 56 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:48,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1619 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-09 00:30:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2025-03-09 00:30:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 354 states have (on average 1.692090395480226) internal successors, (599), 544 states have internal predecessors, (599), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 605 transitions. [2025-03-09 00:30:48,329 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 605 transitions. Word has length 63 [2025-03-09 00:30:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:48,329 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 605 transitions. [2025-03-09 00:30:48,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 605 transitions. [2025-03-09 00:30:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 00:30:48,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:48,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:48,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:30:48,334 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:48,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 451827280, now seen corresponding path program 1 times [2025-03-09 00:30:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970023417] [2025-03-09 00:30:48,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:48,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 00:30:48,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 00:30:48,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:48,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970023417] [2025-03-09 00:30:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970023417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:48,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:48,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405870271] [2025-03-09 00:30:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:48,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:48,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:48,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:48,432 INFO L87 Difference]: Start difference. First operand 549 states and 605 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:48,487 INFO L93 Difference]: Finished difference Result 669 states and 759 transitions. [2025-03-09 00:30:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-09 00:30:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:48,489 INFO L225 Difference]: With dead ends: 669 [2025-03-09 00:30:48,489 INFO L226 Difference]: Without dead ends: 669 [2025-03-09 00:30:48,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:48,490 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 75 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:48,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1128 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-09 00:30:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2025-03-09 00:30:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 474 states have (on average 1.5886075949367089) internal successors, (753), 664 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 759 transitions. [2025-03-09 00:30:48,501 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 759 transitions. Word has length 71 [2025-03-09 00:30:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:48,502 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 759 transitions. [2025-03-09 00:30:48,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 759 transitions. [2025-03-09 00:30:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 00:30:48,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:48,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:48,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:30:48,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:48,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash -879591588, now seen corresponding path program 1 times [2025-03-09 00:30:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122534282] [2025-03-09 00:30:48,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:48,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:48,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 00:30:48,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 00:30:48,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:48,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122534282] [2025-03-09 00:30:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122534282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:30:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623879567] [2025-03-09 00:30:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:30:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:48,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:30:48,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:48,814 INFO L87 Difference]: Start difference. First operand 669 states and 759 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:49,249 INFO L93 Difference]: Finished difference Result 668 states and 758 transitions. [2025-03-09 00:30:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:49,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-09 00:30:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:49,252 INFO L225 Difference]: With dead ends: 668 [2025-03-09 00:30:49,252 INFO L226 Difference]: Without dead ends: 668 [2025-03-09 00:30:49,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:49,253 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:49,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1566 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:30:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-09 00:30:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-03-09 00:30:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 474 states have (on average 1.5864978902953586) internal successors, (752), 663 states have internal predecessors, (752), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 758 transitions. [2025-03-09 00:30:49,265 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 758 transitions. Word has length 79 [2025-03-09 00:30:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:49,266 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 758 transitions. [2025-03-09 00:30:49,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 758 transitions. [2025-03-09 00:30:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 00:30:49,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:49,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:49,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:30:49,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash -879591587, now seen corresponding path program 1 times [2025-03-09 00:30:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949875685] [2025-03-09 00:30:49,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:49,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 00:30:49,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 00:30:49,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:49,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949875685] [2025-03-09 00:30:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949875685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:30:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141877690] [2025-03-09 00:30:49,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:49,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:30:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:30:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:49,679 INFO L87 Difference]: Start difference. First operand 668 states and 758 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:50,163 INFO L93 Difference]: Finished difference Result 667 states and 757 transitions. [2025-03-09 00:30:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-09 00:30:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:50,166 INFO L225 Difference]: With dead ends: 667 [2025-03-09 00:30:50,166 INFO L226 Difference]: Without dead ends: 667 [2025-03-09 00:30:50,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:50,167 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:50,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1529 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:30:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-09 00:30:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-09 00:30:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 473 states have (on average 1.587737843551797) internal successors, (751), 662 states have internal predecessors, (751), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 757 transitions. [2025-03-09 00:30:50,178 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 757 transitions. Word has length 79 [2025-03-09 00:30:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 757 transitions. [2025-03-09 00:30:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 757 transitions. [2025-03-09 00:30:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:30:50,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:50,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:50,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:30:50,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1524715047, now seen corresponding path program 1 times [2025-03-09 00:30:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:50,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331732967] [2025-03-09 00:30:50,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:50,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:30:50,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:30:50,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:50,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331732967] [2025-03-09 00:30:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331732967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:50,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:50,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:30:50,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995681707] [2025-03-09 00:30:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:30:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:50,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:30:50,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:50,392 INFO L87 Difference]: Start difference. First operand 667 states and 757 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:50,899 INFO L93 Difference]: Finished difference Result 679 states and 772 transitions. [2025-03-09 00:30:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:30:50,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-03-09 00:30:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:50,904 INFO L225 Difference]: With dead ends: 679 [2025-03-09 00:30:50,905 INFO L226 Difference]: Without dead ends: 679 [2025-03-09 00:30:50,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:30:50,905 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 6 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:50,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2111 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:30:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-09 00:30:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 673. [2025-03-09 00:30:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.5857740585774058) internal successors, (758), 667 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:30:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 767 transitions. [2025-03-09 00:30:50,916 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 767 transitions. Word has length 87 [2025-03-09 00:30:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:50,916 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 767 transitions. [2025-03-09 00:30:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 767 transitions. [2025-03-09 00:30:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:30:50,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:50,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:50,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:30:50,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:50,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1524715046, now seen corresponding path program 1 times [2025-03-09 00:30:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:50,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255983445] [2025-03-09 00:30:50,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:50,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:30:50,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:30:50,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:50,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255983445] [2025-03-09 00:30:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255983445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:51,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:30:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856040921] [2025-03-09 00:30:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:51,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:30:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:30:51,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:51,377 INFO L87 Difference]: Start difference. First operand 673 states and 767 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:51,946 INFO L93 Difference]: Finished difference Result 673 states and 766 transitions. [2025-03-09 00:30:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-03-09 00:30:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:51,949 INFO L225 Difference]: With dead ends: 673 [2025-03-09 00:30:51,949 INFO L226 Difference]: Without dead ends: 673 [2025-03-09 00:30:51,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:51,950 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:51,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1990 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:30:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-09 00:30:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-09 00:30:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.5836820083682008) internal successors, (757), 667 states have internal predecessors, (757), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:30:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 766 transitions. [2025-03-09 00:30:51,961 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 766 transitions. Word has length 87 [2025-03-09 00:30:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:51,962 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 766 transitions. [2025-03-09 00:30:51,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 766 transitions. [2025-03-09 00:30:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 00:30:51,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:51,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:30:51,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1794683101, now seen corresponding path program 1 times [2025-03-09 00:30:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174507422] [2025-03-09 00:30:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:51,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:30:51,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:30:51,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:52,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:52,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174507422] [2025-03-09 00:30:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174507422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:52,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062290206] [2025-03-09 00:30:52,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:52,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:52,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:52,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:30:52,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:30:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:30:52,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:30:52,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:52,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:52,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 00:30:52,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:52,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:30:52,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:30:52,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:30:52,728 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 19 treesize of output 1 [2025-03-09 00:30:52,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:30:52,801 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 42 treesize of output 41 [2025-03-09 00:30:52,841 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 31 treesize of output 13 [2025-03-09 00:30:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:52,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:52,921 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-09 00:30:52,921 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 21 treesize of output 20 [2025-03-09 00:30:52,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2025-03-09 00:30:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062290206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:52,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:30:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-09 00:30:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891873974] [2025-03-09 00:30:52,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:52,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:30:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:52,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:30:52,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-03-09 00:30:52,940 INFO L87 Difference]: Start difference. First operand 673 states and 766 transitions. Second operand has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:30:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:54,348 INFO L93 Difference]: Finished difference Result 672 states and 765 transitions. [2025-03-09 00:30:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:30:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2025-03-09 00:30:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:54,350 INFO L225 Difference]: With dead ends: 672 [2025-03-09 00:30:54,350 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 00:30:54,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:30:54,351 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 486 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:54,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 3326 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:30:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 00:30:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-09 00:30:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 478 states have (on average 1.5815899581589958) internal successors, (756), 666 states have internal predecessors, (756), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:30:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 765 transitions. [2025-03-09 00:30:54,363 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 765 transitions. Word has length 88 [2025-03-09 00:30:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:54,363 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 765 transitions. [2025-03-09 00:30:54,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:30:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 765 transitions. [2025-03-09 00:30:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 00:30:54,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:54,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:54,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:30:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 00:30:54,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1794683100, now seen corresponding path program 1 times [2025-03-09 00:30:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521030725] [2025-03-09 00:30:54,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:54,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:30:54,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:30:54,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:54,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521030725] [2025-03-09 00:30:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521030725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388028247] [2025-03-09 00:30:55,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:55,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:30:55,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:30:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:30:55,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:30:55,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:55,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:55,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:30:55,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:55,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:30:55,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:30:55,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:30:55,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:30:55,353 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 19 treesize of output 1 [2025-03-09 00:30:55,508 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:30:55,508 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 70 treesize of output 65 [2025-03-09 00:30:55,514 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 49 treesize of output 30 [2025-03-09 00:30:55,548 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 39 treesize of output 21 [2025-03-09 00:30:55,552 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 32 treesize of output 14 [2025-03-09 00:30:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:55,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:55,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:55,673 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 48 treesize of output 52 [2025-03-09 00:30:55,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_571 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 25))) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)))) is different from false [2025-03-09 00:30:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388028247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:55,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:30:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-09 00:30:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29828200] [2025-03-09 00:30:55,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:55,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:30:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:55,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:30:55,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:30:55,706 INFO L87 Difference]: Start difference. First operand 672 states and 765 transitions. Second operand has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:30:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:57,288 INFO L93 Difference]: Finished difference Result 671 states and 764 transitions. [2025-03-09 00:30:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:30:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2025-03-09 00:30:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:57,291 INFO L225 Difference]: With dead ends: 671 [2025-03-09 00:30:57,291 INFO L226 Difference]: Without dead ends: 671 [2025-03-09 00:30:57,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2025-03-09 00:30:57,292 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 528 mSDsluCounter, 2957 mSDsCounter, 0 mSdLazyCounter, 3751 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 3278 Invalid, 3769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3751 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:30:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-09 00:30:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 665. [2025-03-09 00:30:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 473 states have (on average 1.5835095137420718) internal successors, (749), 660 states have internal predecessors, (749), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:30:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 755 transitions. [2025-03-09 00:30:57,308 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 755 transitions. Word has length 88 [2025-03-09 00:30:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:57,308 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 755 transitions. [2025-03-09 00:30:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:30:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 755 transitions. [2025-03-09 00:30:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:30:57,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:57,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:57,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:30:57,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 00:30:57,514 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:57,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash 788597119, now seen corresponding path program 1 times [2025-03-09 00:30:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:57,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988662091] [2025-03-09 00:30:57,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:57,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:30:57,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:30:57,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:57,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988662091] [2025-03-09 00:30:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988662091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:57,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 00:30:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652193219] [2025-03-09 00:30:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:30:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:57,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:30:57,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:30:57,893 INFO L87 Difference]: Start difference. First operand 665 states and 755 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:58,903 INFO L93 Difference]: Finished difference Result 675 states and 768 transitions. [2025-03-09 00:30:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:30:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-03-09 00:30:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:58,906 INFO L225 Difference]: With dead ends: 675 [2025-03-09 00:30:58,906 INFO L226 Difference]: Without dead ends: 675 [2025-03-09 00:30:58,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:30:58,907 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 534 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:58,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 3005 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:30:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-09 00:30:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 674. [2025-03-09 00:30:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 481 states have (on average 1.5779625779625779) internal successors, (759), 668 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:30:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 768 transitions. [2025-03-09 00:30:58,917 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 768 transitions. Word has length 90 [2025-03-09 00:30:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 768 transitions. [2025-03-09 00:30:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 768 transitions. [2025-03-09 00:30:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:30:58,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:58,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:30:58,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:30:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 788597120, now seen corresponding path program 1 times [2025-03-09 00:30:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805295709] [2025-03-09 00:30:58,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:30:58,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:30:58,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:58,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805295709] [2025-03-09 00:30:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805295709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:30:59,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414274806] [2025-03-09 00:30:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:59,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:30:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:59,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:30:59,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:30:59,446 INFO L87 Difference]: Start difference. First operand 674 states and 768 transitions. Second operand has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:00,254 INFO L93 Difference]: Finished difference Result 674 states and 767 transitions. [2025-03-09 00:31:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:31:00,254 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-03-09 00:31:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:00,256 INFO L225 Difference]: With dead ends: 674 [2025-03-09 00:31:00,256 INFO L226 Difference]: Without dead ends: 674 [2025-03-09 00:31:00,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:31:00,257 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 554 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:00,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1615 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:31:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-09 00:31:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-03-09 00:31:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 481 states have (on average 1.5758835758835759) internal successors, (758), 668 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:31:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 767 transitions. [2025-03-09 00:31:00,265 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 767 transitions. Word has length 90 [2025-03-09 00:31:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:00,265 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 767 transitions. [2025-03-09 00:31:00,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 767 transitions. [2025-03-09 00:31:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:31:00,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:00,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:00,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:31:00,266 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:00,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1650921483, now seen corresponding path program 1 times [2025-03-09 00:31:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:00,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456941169] [2025-03-09 00:31:00,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:00,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:31:00,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:31:00,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:00,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456941169] [2025-03-09 00:31:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456941169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139616237] [2025-03-09 00:31:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:00,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:00,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:31:00,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:31:00,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:31:00,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:00,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:00,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 00:31:00,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:00,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:00,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:00,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:00,948 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 19 treesize of output 1 [2025-03-09 00:31:01,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:01,037 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 42 treesize of output 41 [2025-03-09 00:31:01,085 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:01,085 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 42 treesize of output 41 [2025-03-09 00:31:01,098 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 31 treesize of output 13 [2025-03-09 00:31:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:01,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:01,182 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-09 00:31:01,183 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 33 treesize of output 32 [2025-03-09 00:31:01,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_824 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_824))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-09 00:31:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139616237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:01,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-03-09 00:31:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918483375] [2025-03-09 00:31:01,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:01,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:31:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:01,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:31:01,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=280, Unknown=11, NotChecked=34, Total=380 [2025-03-09 00:31:01,189 INFO L87 Difference]: Start difference. First operand 674 states and 767 transitions. Second operand has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:02,222 INFO L93 Difference]: Finished difference Result 673 states and 766 transitions. [2025-03-09 00:31:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:31:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-03-09 00:31:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:02,225 INFO L225 Difference]: With dead ends: 673 [2025-03-09 00:31:02,225 INFO L226 Difference]: Without dead ends: 673 [2025-03-09 00:31:02,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=533, Unknown=11, NotChecked=48, Total=702 [2025-03-09 00:31:02,226 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 526 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:02,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 3055 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:31:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-09 00:31:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-09 00:31:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 481 states have (on average 1.5738045738045738) internal successors, (757), 667 states have internal predecessors, (757), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:31:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 766 transitions. [2025-03-09 00:31:02,234 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 766 transitions. Word has length 91 [2025-03-09 00:31:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:02,234 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 766 transitions. [2025-03-09 00:31:02,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 766 transitions. [2025-03-09 00:31:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:31:02,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:02,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:31:02,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 00:31:02,436 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:02,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1650921482, now seen corresponding path program 1 times [2025-03-09 00:31:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:02,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152037582] [2025-03-09 00:31:02,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:02,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:31:02,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:31:02,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:02,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152037582] [2025-03-09 00:31:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152037582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917335767] [2025-03-09 00:31:02,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:02,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:02,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:03,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:31:03,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:31:03,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:31:03,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:03,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:31:03,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:03,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:03,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:03,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:03,275 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 19 treesize of output 1 [2025-03-09 00:31:03,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:31:03,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:03,412 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 70 treesize of output 65 [2025-03-09 00:31:03,416 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 49 treesize of output 30 [2025-03-09 00:31:03,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:03,476 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 70 treesize of output 65 [2025-03-09 00:31:03,480 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 49 treesize of output 30 [2025-03-09 00:31:03,492 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 39 treesize of output 21 [2025-03-09 00:31:03,494 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 32 treesize of output 14 [2025-03-09 00:31:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:03,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:03,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-09 00:31:03,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:31:03,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:31:03,636 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 84 treesize of output 88 [2025-03-09 00:31:03,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_967) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_3) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_4) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 37))))) is different from false [2025-03-09 00:31:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917335767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:03,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2025-03-09 00:31:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060718770] [2025-03-09 00:31:03,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:31:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:03,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:31:03,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2025-03-09 00:31:03,685 INFO L87 Difference]: Start difference. First operand 673 states and 766 transitions. Second operand has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:31:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:05,349 INFO L93 Difference]: Finished difference Result 672 states and 765 transitions. [2025-03-09 00:31:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:31:05,350 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-03-09 00:31:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:05,352 INFO L225 Difference]: With dead ends: 672 [2025-03-09 00:31:05,352 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 00:31:05,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=640, Unknown=3, NotChecked=162, Total=930 [2025-03-09 00:31:05,352 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 503 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:05,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3453 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 00:31:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 00:31:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 663. [2025-03-09 00:31:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 473 states have (on average 1.5792811839323466) internal successors, (747), 658 states have internal predecessors, (747), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 753 transitions. [2025-03-09 00:31:05,362 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 753 transitions. Word has length 91 [2025-03-09 00:31:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:05,364 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 753 transitions. [2025-03-09 00:31:05,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:31:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 753 transitions. [2025-03-09 00:31:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:31:05,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:05,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:05,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:31:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:05,566 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -373904142, now seen corresponding path program 1 times [2025-03-09 00:31:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:05,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860550674] [2025-03-09 00:31:05,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:05,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:31:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:31:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:05,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860550674] [2025-03-09 00:31:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860550674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:05,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:05,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:31:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257189812] [2025-03-09 00:31:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:31:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:05,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:31:05,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:31:05,939 INFO L87 Difference]: Start difference. First operand 663 states and 753 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:07,078 INFO L93 Difference]: Finished difference Result 676 states and 769 transitions. [2025-03-09 00:31:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:31:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-09 00:31:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:07,081 INFO L225 Difference]: With dead ends: 676 [2025-03-09 00:31:07,081 INFO L226 Difference]: Without dead ends: 676 [2025-03-09 00:31:07,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:31:07,082 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 537 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:07,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 3304 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:31:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-09 00:31:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 675. [2025-03-09 00:31:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 484 states have (on average 1.5702479338842976) internal successors, (760), 669 states have internal predecessors, (760), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:31:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 769 transitions. [2025-03-09 00:31:07,092 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 769 transitions. Word has length 93 [2025-03-09 00:31:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 769 transitions. [2025-03-09 00:31:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 769 transitions. [2025-03-09 00:31:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:31:07,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:07,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:07,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:31:07,093 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -373904141, now seen corresponding path program 1 times [2025-03-09 00:31:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786476612] [2025-03-09 00:31:07,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:07,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:31:07,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:31:07,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:07,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:07,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786476612] [2025-03-09 00:31:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786476612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:07,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:07,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:31:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497764343] [2025-03-09 00:31:07,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:07,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:31:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:07,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:31:07,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:31:07,662 INFO L87 Difference]: Start difference. First operand 675 states and 769 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:08,600 INFO L93 Difference]: Finished difference Result 675 states and 768 transitions. [2025-03-09 00:31:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:31:08,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-09 00:31:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:08,602 INFO L225 Difference]: With dead ends: 675 [2025-03-09 00:31:08,602 INFO L226 Difference]: Without dead ends: 675 [2025-03-09 00:31:08,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:31:08,603 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 517 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:08,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1617 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:31:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-09 00:31:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-03-09 00:31:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 484 states have (on average 1.5681818181818181) internal successors, (759), 669 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:31:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 768 transitions. [2025-03-09 00:31:08,612 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 768 transitions. Word has length 93 [2025-03-09 00:31:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:08,612 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 768 transitions. [2025-03-09 00:31:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 768 transitions. [2025-03-09 00:31:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:31:08,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:08,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:31:08,614 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:08,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:08,614 INFO L85 PathProgramCache]: Analyzing trace with hash -930960708, now seen corresponding path program 1 times [2025-03-09 00:31:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:08,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126461898] [2025-03-09 00:31:08,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:08,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:31:08,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:31:08,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:08,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126461898] [2025-03-09 00:31:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126461898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861185148] [2025-03-09 00:31:09,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:09,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:09,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:09,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:31:09,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:31:09,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:31:09,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:09,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:09,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 00:31:09,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:09,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:09,390 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:09,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:09,395 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 19 treesize of output 1 [2025-03-09 00:31:09,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:09,444 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 42 treesize of output 41 [2025-03-09 00:31:09,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:09,479 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 42 treesize of output 41 [2025-03-09 00:31:09,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:09,515 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 42 treesize of output 41 [2025-03-09 00:31:09,525 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 31 treesize of output 13 [2025-03-09 00:31:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:09,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:09,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-09 00:31:09,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1240))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:31:09,614 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-09 00:31:09,614 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 57 treesize of output 56 [2025-03-09 00:31:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861185148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:09,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-09 00:31:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519331818] [2025-03-09 00:31:09,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:31:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:09,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:31:09,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=380, Unknown=18, NotChecked=82, Total=552 [2025-03-09 00:31:09,655 INFO L87 Difference]: Start difference. First operand 675 states and 768 transitions. Second operand has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:10,802 INFO L93 Difference]: Finished difference Result 674 states and 767 transitions. [2025-03-09 00:31:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:31:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-09 00:31:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:10,805 INFO L225 Difference]: With dead ends: 674 [2025-03-09 00:31:10,805 INFO L226 Difference]: Without dead ends: 674 [2025-03-09 00:31:10,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=715, Unknown=19, NotChecked=114, Total=992 [2025-03-09 00:31:10,807 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 501 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:10,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3355 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:31:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-09 00:31:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-03-09 00:31:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 484 states have (on average 1.5661157024793388) internal successors, (758), 668 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:31:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 767 transitions. [2025-03-09 00:31:10,818 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 767 transitions. Word has length 94 [2025-03-09 00:31:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 767 transitions. [2025-03-09 00:31:10,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 767 transitions. [2025-03-09 00:31:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:31:10,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:10,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:10,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:31:11,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 00:31:11,020 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -930960707, now seen corresponding path program 1 times [2025-03-09 00:31:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:11,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140551600] [2025-03-09 00:31:11,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:11,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:11,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:31:11,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:31:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:11,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140551600] [2025-03-09 00:31:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140551600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064208990] [2025-03-09 00:31:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:11,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:11,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:11,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:31:11,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:31:11,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:31:11,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:11,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:11,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 00:31:11,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:11,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:11,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:31:11,825 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:11,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:11,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:31:11,836 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 19 treesize of output 1 [2025-03-09 00:31:11,875 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 22 treesize of output 10 [2025-03-09 00:31:11,879 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 9 treesize of output 3 [2025-03-09 00:31:11,963 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:11,964 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 62 treesize of output 57 [2025-03-09 00:31:11,968 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 30 treesize of output 13 [2025-03-09 00:31:12,018 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:12,019 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 62 treesize of output 57 [2025-03-09 00:31:12,026 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 30 treesize of output 13 [2025-03-09 00:31:12,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:12,079 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 62 treesize of output 57 [2025-03-09 00:31:12,088 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 30 treesize of output 13 [2025-03-09 00:31:12,101 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 31 treesize of output 13 [2025-03-09 00:31:12,106 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 9 treesize of output 3 [2025-03-09 00:31:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:12,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:12,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:31:12,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:31:12,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1393))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1394) .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1394) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:31:12,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1394) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1393))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1394) .cse2 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:31:12,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1402 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1402))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1401) .cse0 v_ArrVal_1394) (select (select (store .cse1 .cse0 v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1396))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1402 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1402))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1393))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1401) .cse3 v_ArrVal_1394) .cse4 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-09 00:31:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064208990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:12,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:12,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-03-09 00:31:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100895916] [2025-03-09 00:31:12,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:12,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:31:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:12,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:31:12,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-03-09 00:31:12,300 INFO L87 Difference]: Start difference. First operand 674 states and 767 transitions. Second operand has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:13,705 INFO L93 Difference]: Finished difference Result 681 states and 774 transitions. [2025-03-09 00:31:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:31:13,706 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-09 00:31:13,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:13,708 INFO L225 Difference]: With dead ends: 681 [2025-03-09 00:31:13,708 INFO L226 Difference]: Without dead ends: 681 [2025-03-09 00:31:13,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-03-09 00:31:13,708 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 500 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:13,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2325 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:31:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-09 00:31:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 666. [2025-03-09 00:31:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 477 states have (on average 1.5723270440251573) internal successors, (750), 660 states have internal predecessors, (750), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 756 transitions. [2025-03-09 00:31:13,717 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 756 transitions. Word has length 94 [2025-03-09 00:31:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:13,718 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 756 transitions. [2025-03-09 00:31:13,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 756 transitions. [2025-03-09 00:31:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:31:13,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:13,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:13,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:31:13,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:13,923 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:13,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2127669896, now seen corresponding path program 1 times [2025-03-09 00:31:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:13,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348066927] [2025-03-09 00:31:13,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:13,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:13,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:31:13,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:31:13,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:13,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:14,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348066927] [2025-03-09 00:31:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348066927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:14,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:31:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840610866] [2025-03-09 00:31:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:14,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:31:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:31:14,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:31:14,373 INFO L87 Difference]: Start difference. First operand 666 states and 756 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:15,632 INFO L93 Difference]: Finished difference Result 685 states and 778 transitions. [2025-03-09 00:31:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:31:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-09 00:31:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:15,634 INFO L225 Difference]: With dead ends: 685 [2025-03-09 00:31:15,634 INFO L226 Difference]: Without dead ends: 685 [2025-03-09 00:31:15,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:31:15,635 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 536 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3599 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:15,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3599 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:31:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-09 00:31:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 681. [2025-03-09 00:31:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 491 states have (on average 1.560081466395112) internal successors, (766), 674 states have internal predecessors, (766), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 773 transitions. [2025-03-09 00:31:15,644 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 773 transitions. Word has length 96 [2025-03-09 00:31:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 773 transitions. [2025-03-09 00:31:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 773 transitions. [2025-03-09 00:31:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:31:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:15,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:15,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 00:31:15,645 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2127669895, now seen corresponding path program 1 times [2025-03-09 00:31:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:15,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505539707] [2025-03-09 00:31:15,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:15,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:31:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:31:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:15,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505539707] [2025-03-09 00:31:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505539707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:16,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:16,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 00:31:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678774141] [2025-03-09 00:31:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:31:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:16,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:31:16,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:31:16,260 INFO L87 Difference]: Start difference. First operand 681 states and 773 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:17,366 INFO L93 Difference]: Finished difference Result 684 states and 777 transitions. [2025-03-09 00:31:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:31:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-09 00:31:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:17,368 INFO L225 Difference]: With dead ends: 684 [2025-03-09 00:31:17,368 INFO L226 Difference]: Without dead ends: 684 [2025-03-09 00:31:17,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:31:17,369 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 556 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:17,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2067 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:31:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-09 00:31:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 681. [2025-03-09 00:31:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 491 states have (on average 1.5580448065173116) internal successors, (765), 674 states have internal predecessors, (765), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 772 transitions. [2025-03-09 00:31:17,385 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 772 transitions. Word has length 96 [2025-03-09 00:31:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:17,385 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 772 transitions. [2025-03-09 00:31:17,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 772 transitions. [2025-03-09 00:31:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:31:17,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:17,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:17,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 00:31:17,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:17,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1646195858, now seen corresponding path program 1 times [2025-03-09 00:31:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:17,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339360274] [2025-03-09 00:31:17,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:17,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:31:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:31:17,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339360274] [2025-03-09 00:31:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339360274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503006186] [2025-03-09 00:31:17,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:17,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:17,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:17,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:17,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:31:17,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:31:18,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:31:18,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:18,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:18,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 00:31:18,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:18,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:18,105 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:18,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:18,109 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 19 treesize of output 1 [2025-03-09 00:31:18,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:18,161 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 42 treesize of output 41 [2025-03-09 00:31:18,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:18,193 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 42 treesize of output 41 [2025-03-09 00:31:18,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:18,226 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 42 treesize of output 41 [2025-03-09 00:31:18,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:18,255 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 42 treesize of output 41 [2025-03-09 00:31:18,263 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 31 treesize of output 13 [2025-03-09 00:31:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:18,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:18,319 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1700))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:31:18,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1699))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1700)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:31:22,446 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-09 00:31:22,447 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 105 treesize of output 104 [2025-03-09 00:31:22,460 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1704))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1699)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1700)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2025-03-09 00:31:22,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503006186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:22,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:22,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-03-09 00:31:22,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567798393] [2025-03-09 00:31:22,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:22,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:31:22,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:22,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:31:22,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=475, Unknown=40, NotChecked=144, Total=756 [2025-03-09 00:31:22,466 INFO L87 Difference]: Start difference. First operand 681 states and 772 transitions. Second operand has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:24,161 INFO L93 Difference]: Finished difference Result 683 states and 776 transitions. [2025-03-09 00:31:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:31:24,161 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-03-09 00:31:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:24,163 INFO L225 Difference]: With dead ends: 683 [2025-03-09 00:31:24,163 INFO L226 Difference]: Without dead ends: 683 [2025-03-09 00:31:24,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=186, Invalid=902, Unknown=46, NotChecked=198, Total=1332 [2025-03-09 00:31:24,164 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 518 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:24,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3329 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3072 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:31:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-09 00:31:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2025-03-09 00:31:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 491 states have (on average 1.5560081466395113) internal successors, (764), 673 states have internal predecessors, (764), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 771 transitions. [2025-03-09 00:31:24,172 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 771 transitions. Word has length 97 [2025-03-09 00:31:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:24,172 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 771 transitions. [2025-03-09 00:31:24,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 771 transitions. [2025-03-09 00:31:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:31:24,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:24,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:24,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:31:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:24,373 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1646195857, now seen corresponding path program 1 times [2025-03-09 00:31:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766618373] [2025-03-09 00:31:24,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:24,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:31:24,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:31:24,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:24,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:25,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766618373] [2025-03-09 00:31:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766618373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096474573] [2025-03-09 00:31:25,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:25,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:25,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:25,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:25,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:31:25,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:31:25,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:31:25,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:25,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:25,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 00:31:25,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:25,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:25,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:31:25,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:25,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:25,364 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 19 treesize of output 1 [2025-03-09 00:31:25,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:31:25,445 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 22 treesize of output 10 [2025-03-09 00:31:25,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 9 treesize of output 3 [2025-03-09 00:31:25,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:25,560 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 62 treesize of output 57 [2025-03-09 00:31:25,568 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 30 treesize of output 13 [2025-03-09 00:31:25,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:25,633 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 62 treesize of output 57 [2025-03-09 00:31:25,638 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 30 treesize of output 13 [2025-03-09 00:31:25,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:25,685 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 62 treesize of output 57 [2025-03-09 00:31:25,692 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 30 treesize of output 13 [2025-03-09 00:31:25,763 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:25,763 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 62 treesize of output 57 [2025-03-09 00:31:25,769 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 41 treesize of output 22 [2025-03-09 00:31:25,808 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 31 treesize of output 13 [2025-03-09 00:31:25,815 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 30 treesize of output 12 [2025-03-09 00:31:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:25,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:26,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1868))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1868))) (or (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1867))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2025-03-09 00:31:26,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) 0)))) (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1868))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1867))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse3 .cse4 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2025-03-09 00:31:26,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1865))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1866) .cse5 v_ArrVal_1868))) (or (< (+ 8 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1867))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1865))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1866) .cse8 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (< (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)))))))) is different from false [2025-03-09 00:31:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096474573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:26,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-03-09 00:31:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419211786] [2025-03-09 00:31:26,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:26,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:31:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:26,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:31:26,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=792, Unknown=21, NotChecked=180, Total=1122 [2025-03-09 00:31:26,567 INFO L87 Difference]: Start difference. First operand 680 states and 771 transitions. Second operand has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:31:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:28,658 INFO L93 Difference]: Finished difference Result 682 states and 775 transitions. [2025-03-09 00:31:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:31:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-03-09 00:31:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:28,660 INFO L225 Difference]: With dead ends: 682 [2025-03-09 00:31:28,660 INFO L226 Difference]: Without dead ends: 682 [2025-03-09 00:31:28,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1185, Unknown=21, NotChecked=222, Total=1640 [2025-03-09 00:31:28,660 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 504 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 3939 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:28,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 3073 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3939 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 00:31:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-09 00:31:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 664. [2025-03-09 00:31:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 477 states have (on average 1.5681341719077568) internal successors, (748), 658 states have internal predecessors, (748), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 754 transitions. [2025-03-09 00:31:28,666 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 754 transitions. Word has length 97 [2025-03-09 00:31:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 754 transitions. [2025-03-09 00:31:28,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:31:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 754 transitions. [2025-03-09 00:31:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:31:28,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:28,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:28,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:31:28,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 00:31:28,871 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -279115982, now seen corresponding path program 1 times [2025-03-09 00:31:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:28,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131588262] [2025-03-09 00:31:28,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:28,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:31:28,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:31:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131588262] [2025-03-09 00:31:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131588262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 00:31:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429675771] [2025-03-09 00:31:29,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:29,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:31:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:29,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:31:29,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:31:29,377 INFO L87 Difference]: Start difference. First operand 664 states and 754 transitions. Second operand has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:30,404 INFO L93 Difference]: Finished difference Result 687 states and 780 transitions. [2025-03-09 00:31:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:31:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2025-03-09 00:31:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:30,407 INFO L225 Difference]: With dead ends: 687 [2025-03-09 00:31:30,407 INFO L226 Difference]: Without dead ends: 687 [2025-03-09 00:31:30,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:31:30,407 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 560 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:30,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 2436 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:31:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-09 00:31:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 683. [2025-03-09 00:31:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 495 states have (on average 1.5515151515151515) internal successors, (768), 676 states have internal predecessors, (768), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 775 transitions. [2025-03-09 00:31:30,413 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 775 transitions. Word has length 100 [2025-03-09 00:31:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:30,413 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 775 transitions. [2025-03-09 00:31:30,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 775 transitions. [2025-03-09 00:31:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:31:30,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:30,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:30,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:31:30,415 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:30,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:30,415 INFO L85 PathProgramCache]: Analyzing trace with hash -279115981, now seen corresponding path program 1 times [2025-03-09 00:31:30,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:30,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024899039] [2025-03-09 00:31:30,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:30,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:30,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:31:30,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:31:30,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024899039] [2025-03-09 00:31:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024899039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 00:31:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178904045] [2025-03-09 00:31:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:31,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:31:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:31,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:31:31,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:31:31,355 INFO L87 Difference]: Start difference. First operand 683 states and 775 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:32,871 INFO L93 Difference]: Finished difference Result 686 states and 779 transitions. [2025-03-09 00:31:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:31:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2025-03-09 00:31:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:32,873 INFO L225 Difference]: With dead ends: 686 [2025-03-09 00:31:32,873 INFO L226 Difference]: Without dead ends: 686 [2025-03-09 00:31:32,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:31:32,875 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 538 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:32,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2320 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:31:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-09 00:31:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 683. [2025-03-09 00:31:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 495 states have (on average 1.5494949494949495) internal successors, (767), 676 states have internal predecessors, (767), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 774 transitions. [2025-03-09 00:31:32,882 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 774 transitions. Word has length 100 [2025-03-09 00:31:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:32,882 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 774 transitions. [2025-03-09 00:31:32,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 774 transitions. [2025-03-09 00:31:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:31:32,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:32,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 00:31:32,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1731711528, now seen corresponding path program 1 times [2025-03-09 00:31:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100788750] [2025-03-09 00:31:32,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:32,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:31:32,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:31:32,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:32,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100788750] [2025-03-09 00:31:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100788750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927539240] [2025-03-09 00:31:33,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:33,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:33,407 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:31:33,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:31:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:31:33,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:33,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:33,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:31:33,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:33,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:33,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:33,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-03-09 00:31:33,671 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 19 treesize of output 1 [2025-03-09 00:31:33,742 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:33,742 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 42 treesize of output 41 [2025-03-09 00:31:33,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:33,776 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 42 treesize of output 41 [2025-03-09 00:31:33,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:33,810 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 42 treesize of output 41 [2025-03-09 00:31:33,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:33,850 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 42 treesize of output 41 [2025-03-09 00:31:33,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:33,888 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 42 treesize of output 41 [2025-03-09 00:31:33,898 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 31 treesize of output 13 [2025-03-09 00:31:33,914 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:31:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 00:31:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:33,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:34,493 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-09 00:31:34,493 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 597 treesize of output 794 [2025-03-09 00:31:34,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2207 (Array Int Int)) (v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2205 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2212))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2205)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2206)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2207)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2208)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-09 00:31:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927539240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:34,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2025-03-09 00:31:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481277193] [2025-03-09 00:31:34,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:31:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:34,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:31:34,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=933, Unknown=42, NotChecked=64, Total=1190 [2025-03-09 00:31:34,505 INFO L87 Difference]: Start difference. First operand 683 states and 774 transitions. Second operand has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:31:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:36,401 INFO L93 Difference]: Finished difference Result 685 states and 778 transitions. [2025-03-09 00:31:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:31:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-03-09 00:31:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:36,403 INFO L225 Difference]: With dead ends: 685 [2025-03-09 00:31:36,403 INFO L226 Difference]: Without dead ends: 685 [2025-03-09 00:31:36,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1581, Unknown=42, NotChecked=84, Total=1980 [2025-03-09 00:31:36,403 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 497 mSDsluCounter, 3897 mSDsCounter, 0 mSdLazyCounter, 3894 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 3912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:36,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 4215 Invalid, 3912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:31:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-09 00:31:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2025-03-09 00:31:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 495 states have (on average 1.5474747474747474) internal successors, (766), 675 states have internal predecessors, (766), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 773 transitions. [2025-03-09 00:31:36,410 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 773 transitions. Word has length 101 [2025-03-09 00:31:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:36,410 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 773 transitions. [2025-03-09 00:31:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:31:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 773 transitions. [2025-03-09 00:31:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:31:36,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:36,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:36,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:31:36,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:36,611 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:36,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1731711529, now seen corresponding path program 1 times [2025-03-09 00:31:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:36,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456679438] [2025-03-09 00:31:36,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:31:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:31:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456679438] [2025-03-09 00:31:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456679438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867662363] [2025-03-09 00:31:37,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:37,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:37,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:37,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:37,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:31:37,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:31:37,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:31:37,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:37,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:37,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-09 00:31:37,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:37,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:37,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:31:37,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:37,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:37,805 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 19 treesize of output 1 [2025-03-09 00:31:37,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:31:37,868 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 22 treesize of output 10 [2025-03-09 00:31:37,872 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 9 treesize of output 3 [2025-03-09 00:31:37,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:37,975 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 62 treesize of output 57 [2025-03-09 00:31:37,983 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 30 treesize of output 13 [2025-03-09 00:31:38,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:38,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:31:38,040 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 30 treesize of output 13 [2025-03-09 00:31:38,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:38,093 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 73 treesize of output 66 [2025-03-09 00:31:38,097 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 30 treesize of output 13 [2025-03-09 00:31:38,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:38,166 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 73 treesize of output 66 [2025-03-09 00:31:38,171 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 30 treesize of output 13 [2025-03-09 00:31:38,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:38,238 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 73 treesize of output 66 [2025-03-09 00:31:38,244 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 30 treesize of output 13 [2025-03-09 00:31:38,266 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 42 treesize of output 18 [2025-03-09 00:31:38,271 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 9 treesize of output 3 [2025-03-09 00:31:38,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:31:38,282 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-03-09 00:31:38,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:38,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:38,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:38,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2393) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (forall ((v_ArrVal_2397 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2394))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2393) .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2397) (select (select (store .cse2 .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2025-03-09 00:31:38,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:31:38,686 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 172 treesize of output 190 [2025-03-09 00:31:38,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2391))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2392) .cse0 v_ArrVal_2393) (select (select (store .cse1 .cse0 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((v_prenex_23 Int)) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_22))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_prenex_25))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ 3 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_27) .cse3 v_prenex_26) .cse4 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse5 .cse4 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (= v_prenex_23 |c_ULTIMATE.start_main_#t~mem54#1.base|))))) is different from false [2025-03-09 00:31:38,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2391))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2392) .cse1 v_ArrVal_2393) (select (select (store .cse2 .cse1 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((v_prenex_23 Int)) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_22))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_prenex_25))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_27) .cse4 v_prenex_26) .cse5 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 3) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse6 .cse5 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (= .cse0 v_prenex_23)))))) is different from false [2025-03-09 00:31:38,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2389 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2390))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= .cse0 v_prenex_23) (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse5 (store .cse6 .cse0 v_prenex_22))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_prenex_25))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (+ 3 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2389) .cse0 v_prenex_27) .cse1 v_prenex_26) .cse2 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse4 .cse2 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2390))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2391))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2389) .cse7 v_ArrVal_2392) .cse8 v_ArrVal_2393) (select (select (store .cse9 .cse8 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2395))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))))) is different from false [2025-03-09 00:31:39,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2390))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2391))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2389) .cse1 v_ArrVal_2392) .cse2 v_ArrVal_2393) (select (select (store .cse3 .cse2 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2395))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2389 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2390))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse10 (store .cse11 .cse6 v_prenex_22))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_prenex_25))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2389) .cse6 v_prenex_27) .cse7 v_prenex_26) .cse8 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse9 .cse8 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (= .cse6 v_prenex_23)))))))) is different from false [2025-03-09 00:31:39,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2403))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2390))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2391))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2402) .cse0 v_ArrVal_2389) .cse1 v_ArrVal_2392) .cse2 v_ArrVal_2393) (select (select (store .cse3 .cse2 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2395))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2389 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2403))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2390))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse12 (store .cse13 .cse8 v_prenex_22))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_25))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2402) .cse7 v_ArrVal_2389) .cse8 v_prenex_27) .cse9 v_prenex_26) .cse10 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse11 .cse10 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (= v_prenex_23 .cse8))))))))) is different from false [2025-03-09 00:31:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867662363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:39,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:31:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2025-03-09 00:31:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287767465] [2025-03-09 00:31:39,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:31:39,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:31:39,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:39,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:31:39,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=815, Unknown=13, NotChecked=378, Total=1332 [2025-03-09 00:31:39,562 INFO L87 Difference]: Start difference. First operand 682 states and 773 transitions. Second operand has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:43,038 INFO L93 Difference]: Finished difference Result 684 states and 777 transitions. [2025-03-09 00:31:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:31:43,038 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-09 00:31:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:43,040 INFO L225 Difference]: With dead ends: 684 [2025-03-09 00:31:43,040 INFO L226 Difference]: Without dead ends: 684 [2025-03-09 00:31:43,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=243, Invalid=1574, Unknown=13, NotChecked=522, Total=2352 [2025-03-09 00:31:43,041 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 522 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 3949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:43,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3049 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3949 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-09 00:31:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-09 00:31:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 662. [2025-03-09 00:31:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 477 states have (on average 1.5639412997903563) internal successors, (746), 656 states have internal predecessors, (746), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:31:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 752 transitions. [2025-03-09 00:31:43,049 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 752 transitions. Word has length 101 [2025-03-09 00:31:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:43,050 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 752 transitions. [2025-03-09 00:31:43,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:31:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 752 transitions. [2025-03-09 00:31:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 00:31:43,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:43,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:43,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:31:43,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-09 00:31:43,256 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:43,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash -87123703, now seen corresponding path program 1 times [2025-03-09 00:31:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259280301] [2025-03-09 00:31:43,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:43,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 00:31:43,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 00:31:43,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:43,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259280301] [2025-03-09 00:31:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259280301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:43,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:43,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:31:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824964513] [2025-03-09 00:31:43,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:43,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:31:43,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:43,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:31:43,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:31:43,703 INFO L87 Difference]: Start difference. First operand 662 states and 752 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:45,223 INFO L93 Difference]: Finished difference Result 688 states and 781 transitions. [2025-03-09 00:31:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:31:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2025-03-09 00:31:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:45,225 INFO L225 Difference]: With dead ends: 688 [2025-03-09 00:31:45,225 INFO L226 Difference]: Without dead ends: 688 [2025-03-09 00:31:45,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:31:45,226 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 501 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:45,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2713 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:31:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-09 00:31:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 684. [2025-03-09 00:31:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 498 states have (on average 1.5441767068273093) internal successors, (769), 677 states have internal predecessors, (769), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 776 transitions. [2025-03-09 00:31:45,233 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 776 transitions. Word has length 103 [2025-03-09 00:31:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:45,233 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 776 transitions. [2025-03-09 00:31:45,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 776 transitions. [2025-03-09 00:31:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 00:31:45,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:45,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:45,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 00:31:45,234 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -87123702, now seen corresponding path program 1 times [2025-03-09 00:31:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118223564] [2025-03-09 00:31:45,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:45,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 00:31:45,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 00:31:45,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:45,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118223564] [2025-03-09 00:31:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118223564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:46,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:46,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-09 00:31:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188086451] [2025-03-09 00:31:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:46,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:31:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:46,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:31:46,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:31:46,150 INFO L87 Difference]: Start difference. First operand 684 states and 776 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:47,603 INFO L93 Difference]: Finished difference Result 687 states and 780 transitions. [2025-03-09 00:31:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:31:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2025-03-09 00:31:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:47,605 INFO L225 Difference]: With dead ends: 687 [2025-03-09 00:31:47,605 INFO L226 Difference]: Without dead ends: 687 [2025-03-09 00:31:47,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-03-09 00:31:47,606 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 557 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:47,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1940 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:31:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-09 00:31:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2025-03-09 00:31:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 677 states have internal predecessors, (768), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 775 transitions. [2025-03-09 00:31:47,611 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 775 transitions. Word has length 103 [2025-03-09 00:31:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:47,612 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 775 transitions. [2025-03-09 00:31:47,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 775 transitions. [2025-03-09 00:31:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 00:31:47,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:47,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:47,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 00:31:47,613 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:47,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1728617901, now seen corresponding path program 1 times [2025-03-09 00:31:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805729498] [2025-03-09 00:31:47,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:31:47,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:31:47,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:47,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:31:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:47,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805729498] [2025-03-09 00:31:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805729498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:31:47,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:31:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:31:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680754355] [2025-03-09 00:31:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:31:47,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:31:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:31:47,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:31:47,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:31:47,848 INFO L87 Difference]: Start difference. First operand 684 states and 775 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:31:48,308 INFO L93 Difference]: Finished difference Result 683 states and 774 transitions. [2025-03-09 00:31:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:31:48,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2025-03-09 00:31:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:31:48,310 INFO L225 Difference]: With dead ends: 683 [2025-03-09 00:31:48,310 INFO L226 Difference]: Without dead ends: 683 [2025-03-09 00:31:48,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:31:48,311 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 2 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:31:48,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1631 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:31:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-09 00:31:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-09 00:31:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 498 states have (on average 1.5401606425702812) internal successors, (767), 676 states have internal predecessors, (767), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:31:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 774 transitions. [2025-03-09 00:31:48,316 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 774 transitions. Word has length 104 [2025-03-09 00:31:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:31:48,316 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 774 transitions. [2025-03-09 00:31:48,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:31:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 774 transitions. [2025-03-09 00:31:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 00:31:48,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:31:48,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:31:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 00:31:48,317 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:31:48,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:31:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1728617900, now seen corresponding path program 1 times [2025-03-09 00:31:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:31:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479805313] [2025-03-09 00:31:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:31:48,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:31:48,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:31:48,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:48,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:31:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479805313] [2025-03-09 00:31:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479805313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:31:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353990743] [2025-03-09 00:31:49,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:31:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:31:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:31:49,244 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:31:49,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:31:49,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:31:49,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:31:49,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:31:49,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:31:49,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-09 00:31:49,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:31:49,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:31:49,654 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:31:49,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:31:49,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:31:49,680 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 19 treesize of output 1 [2025-03-09 00:31:49,831 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:49,831 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 62 treesize of output 57 [2025-03-09 00:31:49,835 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 30 treesize of output 13 [2025-03-09 00:31:49,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:49,917 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 73 treesize of output 66 [2025-03-09 00:31:49,922 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 30 treesize of output 13 [2025-03-09 00:31:50,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:31:50,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 50 [2025-03-09 00:31:50,041 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 30 treesize of output 13 [2025-03-09 00:31:50,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:50,134 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 73 treesize of output 66 [2025-03-09 00:31:50,142 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 30 treesize of output 13 [2025-03-09 00:31:50,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:50,227 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 73 treesize of output 66 [2025-03-09 00:31:50,231 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 30 treesize of output 13 [2025-03-09 00:31:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:31:50,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 15 [2025-03-09 00:31:50,319 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-03-09 00:31:50,319 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 17 treesize of output 17 [2025-03-09 00:31:50,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:31:50,375 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 62 treesize of output 57 [2025-03-09 00:31:50,379 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 30 treesize of output 13 [2025-03-09 00:31:50,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:31:50,402 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 9 treesize of output 3 [2025-03-09 00:31:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:31:50,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:31:50,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2861 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:31:50,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2859 Int) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2858))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2857) .cse0 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse2 .cse0 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2861 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2857) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:32:05,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:32:05,665 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 1046 treesize of output 1064 [2025-03-09 00:32:06,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2859 Int) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2852 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2850))) (or (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2851))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2856))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2858))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store .cse0 .cse1 v_ArrVal_2854) .cse2 v_ArrVal_2855) .cse3 v_ArrVal_2857) .cse4 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse6 .cse4 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| |c_ULTIMATE.start_main_#t~mem53#1.base|)))) (forall ((v_prenex_37 Int) (v_prenex_32 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_40 Int) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_39))) (or (< (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37) (< 0 (+ (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_38))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 (store (select .cse16 .cse11) (+ v_prenex_37 4) v_prenex_40)))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_prenex_34))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store .cse10 .cse11 v_prenex_36) .cse12 v_prenex_35) .cse13 v_prenex_33) (select (select (store .cse14 .cse13 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41))))))) is different from false [2025-03-09 00:32:07,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2859 Int) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2852 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2850))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2851))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_2856))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2858))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ (select (select (store (store (store (store .cse1 .cse2 v_ArrVal_2854) .cse3 v_ArrVal_2855) .cse4 v_ArrVal_2857) .cse5 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse7 .cse5 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))) (< (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|)))) (forall ((v_prenex_37 Int) (v_prenex_32 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_40 Int) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_39))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_37) (< 0 (+ 41 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_38))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse12 (store (select .cse17 .cse12) (+ v_prenex_37 4) v_prenex_40)))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_prenex_34))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store .cse11 .cse12 v_prenex_36) .cse13 v_prenex_35) .cse14 v_prenex_33) (select (select (store .cse15 .cse14 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2025-03-09 00:32:07,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:32:07,526 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 4318 treesize of output 4322