./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-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_test4-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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:32:47,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:32:47,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:32:47,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:32:47,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:32:47,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:32:47,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:32:47,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:32:47,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:32:47,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:32:47,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:32:47,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:32:47,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:32:47,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:32:47,894 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:32:47,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:32:47,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:32:47,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:32:47,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:32:47,896 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2025-03-09 00:32:48,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:32:48,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:32:48,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:32:48,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:32:48,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:32:48,115 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_test4-1.i [2025-03-09 00:32:49,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8918c99af/7fcb74a99c834194ab591253620ace9c/FLAGdb20337f1 [2025-03-09 00:32:49,654 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:32:49,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2025-03-09 00:32:49,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8918c99af/7fcb74a99c834194ab591253620ace9c/FLAGdb20337f1 [2025-03-09 00:32:49,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8918c99af/7fcb74a99c834194ab591253620ace9c [2025-03-09 00:32:49,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:32:49,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:32:49,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:32:49,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:32:49,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:32:49,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:32:49" (1/1) ... [2025-03-09 00:32:49,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:49, skipping insertion in model container [2025-03-09 00:32:49,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:32:49" (1/1) ... [2025-03-09 00:32:49,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:32:50,001 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:32:50,027 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:32:50,031 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:32:50,034 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:32:50,038 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:32:50,066 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:32:50,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:32:50,073 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:32:50,079 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:32:50,087 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:32:50,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:32:50,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:32:50,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:32:50,208 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:32:50,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50 WrapperNode [2025-03-09 00:32:50,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:32:50,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:32:50,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:32:50,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:32:50,216 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:32:50" (1/1) ... [2025-03-09 00:32:50,242 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:32:50" (1/1) ... [2025-03-09 00:32:50,290 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1557 [2025-03-09 00:32:50,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:32:50,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:32:50,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:32:50,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:32:50,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,384 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-09 00:32:50,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:32:50,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:32:50,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:32:50,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:32:50,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (1/1) ... [2025-03-09 00:32:50,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:32:50,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:32:50,466 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:32:50,471 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:32:50,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:32:50,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:32:50,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 00:32:50,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 00:32:50,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:32:50,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:32:50,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:32:50,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:32:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:32:50,488 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:32:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:32:50,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:32:50,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:32:50,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:32:52,659 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2025-03-09 00:32:52,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:32:52,709 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:32:52,709 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-09 00:32:52,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:32:52 BoogieIcfgContainer [2025-03-09 00:32:52,710 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:32:52,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:32:52,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:32:52,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:32:52,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:32:49" (1/3) ... [2025-03-09 00:32:52,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3877cc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:32:52, skipping insertion in model container [2025-03-09 00:32:52,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:32:50" (2/3) ... [2025-03-09 00:32:52,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3877cc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:32:52, skipping insertion in model container [2025-03-09 00:32:52,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:32:52" (3/3) ... [2025-03-09 00:32:52,720 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2025-03-09 00:32:52,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:32:52,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test4-1.i that has 4 procedures, 1449 locations, 1 initial locations, 34 loop locations, and 628 error locations. [2025-03-09 00:32:52,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:32:52,816 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;@1f2d29b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:32:52,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-03-09 00:32:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 1444 states, 803 states have (on average 2.0784557907845578) internal successors, (1669), 1435 states have internal predecessors, (1669), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:32:52,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:52,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:32:52,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1700539668, now seen corresponding path program 1 times [2025-03-09 00:32:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974586462] [2025-03-09 00:32:52,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:52,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:32:52,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:32:52,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:52,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:52,946 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:32:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974586462] [2025-03-09 00:32:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974586462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:32:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829079414] [2025-03-09 00:32:52,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:52,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:32:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:52,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:32:52,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:32:52,972 INFO L87 Difference]: Start difference. First operand has 1444 states, 803 states have (on average 2.0784557907845578) internal successors, (1669), 1435 states have internal predecessors, (1669), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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:32:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:53,115 INFO L93 Difference]: Finished difference Result 1425 states and 1619 transitions. [2025-03-09 00:32:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:32:53,117 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:32:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:53,131 INFO L225 Difference]: With dead ends: 1425 [2025-03-09 00:32:53,131 INFO L226 Difference]: Without dead ends: 1423 [2025-03-09 00:32:53,133 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:32:53,135 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:53,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1575 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:32:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-09 00:32:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2025-03-09 00:32:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 793 states have (on average 1.9987389659520807) internal successors, (1585), 1414 states have internal predecessors, (1585), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1617 transitions. [2025-03-09 00:32:53,213 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1617 transitions. Word has length 5 [2025-03-09 00:32:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:53,213 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1617 transitions. [2025-03-09 00:32:53,213 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:32:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1617 transitions. [2025-03-09 00:32:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:32:53,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:53,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:32:53,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:32:53,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:53,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1700539699, now seen corresponding path program 1 times [2025-03-09 00:32:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522426071] [2025-03-09 00:32:53,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:53,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:32:53,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:32:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:53,310 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:32:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522426071] [2025-03-09 00:32:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522426071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:53,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:53,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:32:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245234082] [2025-03-09 00:32:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:53,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:32:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:53,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:32:53,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:32:53,312 INFO L87 Difference]: Start difference. First operand 1423 states and 1617 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:32:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:54,131 INFO L93 Difference]: Finished difference Result 1330 states and 1525 transitions. [2025-03-09 00:32:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:32:54,132 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:32:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:54,136 INFO L225 Difference]: With dead ends: 1330 [2025-03-09 00:32:54,136 INFO L226 Difference]: Without dead ends: 1330 [2025-03-09 00:32:54,136 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:32:54,136 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 1359 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:54,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 877 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:32:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-09 00:32:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1329. [2025-03-09 00:32:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 793 states have (on average 1.880201765447667) internal successors, (1491), 1320 states have internal predecessors, (1491), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1523 transitions. [2025-03-09 00:32:54,161 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1523 transitions. Word has length 5 [2025-03-09 00:32:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1523 transitions. [2025-03-09 00:32:54,161 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:32:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1523 transitions. [2025-03-09 00:32:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:32:54,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:54,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:32:54,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:32:54,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1700539700, now seen corresponding path program 1 times [2025-03-09 00:32:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:54,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810887453] [2025-03-09 00:32:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:54,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:32:54,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:32:54,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:54,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:54,251 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:32:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810887453] [2025-03-09 00:32:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810887453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:54,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:32:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539343178] [2025-03-09 00:32:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:54,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:32:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:54,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:32:54,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:32:54,253 INFO L87 Difference]: Start difference. First operand 1329 states and 1523 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:32:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:55,117 INFO L93 Difference]: Finished difference Result 1742 states and 2014 transitions. [2025-03-09 00:32:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:32:55,117 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:32:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:55,123 INFO L225 Difference]: With dead ends: 1742 [2025-03-09 00:32:55,123 INFO L226 Difference]: Without dead ends: 1742 [2025-03-09 00:32:55,124 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:32:55,124 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 815 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:55,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1862 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:32:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-03-09 00:32:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1590. [2025-03-09 00:32:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1064 states have (on average 1.8449248120300752) internal successors, (1963), 1581 states have internal predecessors, (1963), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1995 transitions. [2025-03-09 00:32:55,157 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 1995 transitions. Word has length 5 [2025-03-09 00:32:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:55,157 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 1995 transitions. [2025-03-09 00:32:55,157 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:32:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1995 transitions. [2025-03-09 00:32:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:32:55,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:55,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:32:55,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:32:55,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:55,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1698887348, now seen corresponding path program 1 times [2025-03-09 00:32:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:55,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162646257] [2025-03-09 00:32:55,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:55,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:32:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:32:55,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:55,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:55,196 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:32:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:55,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162646257] [2025-03-09 00:32:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162646257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:55,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:32:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624556958] [2025-03-09 00:32:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:32:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:55,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:32:55,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:32:55,199 INFO L87 Difference]: Start difference. First operand 1590 states and 1995 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:32:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:55,366 INFO L93 Difference]: Finished difference Result 3132 states and 3922 transitions. [2025-03-09 00:32:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:32:55,366 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:32:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:55,376 INFO L225 Difference]: With dead ends: 3132 [2025-03-09 00:32:55,376 INFO L226 Difference]: Without dead ends: 3132 [2025-03-09 00:32:55,377 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:32:55,377 INFO L435 NwaCegarLoop]: 1693 mSDtfsCounter, 1432 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:55,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3156 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:32:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2025-03-09 00:32:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 1591. [2025-03-09 00:32:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1065 states have (on average 1.844131455399061) internal successors, (1964), 1582 states have internal predecessors, (1964), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1996 transitions. [2025-03-09 00:32:55,416 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1996 transitions. Word has length 5 [2025-03-09 00:32:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:55,416 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 1996 transitions. [2025-03-09 00:32:55,416 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:32:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1996 transitions. [2025-03-09 00:32:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:32:55,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:55,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:32:55,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:32:55,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash 379549975, now seen corresponding path program 1 times [2025-03-09 00:32:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:55,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618675495] [2025-03-09 00:32:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:55,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:32:55,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:32:55,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:55,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:55,499 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:32:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618675495] [2025-03-09 00:32:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618675495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:55,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:55,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:32:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532594209] [2025-03-09 00:32:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:32:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:55,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:32:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:32:55,501 INFO L87 Difference]: Start difference. First operand 1591 states and 1996 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:32:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:56,423 INFO L93 Difference]: Finished difference Result 1617 states and 2049 transitions. [2025-03-09 00:32:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:32:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-09 00:32:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:56,428 INFO L225 Difference]: With dead ends: 1617 [2025-03-09 00:32:56,428 INFO L226 Difference]: Without dead ends: 1617 [2025-03-09 00:32:56,428 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:32:56,429 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 1627 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:56,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 1538 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:32:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-03-09 00:32:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1568. [2025-03-09 00:32:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1065 states have (on average 1.8225352112676056) internal successors, (1941), 1559 states have internal predecessors, (1941), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1973 transitions. [2025-03-09 00:32:56,453 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1973 transitions. Word has length 10 [2025-03-09 00:32:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:56,453 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 1973 transitions. [2025-03-09 00:32:56,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:32:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1973 transitions. [2025-03-09 00:32:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:32:56,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:56,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:32:56,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:32:56,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:56,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash 379549976, now seen corresponding path program 1 times [2025-03-09 00:32:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:56,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716591952] [2025-03-09 00:32:56,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:56,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:56,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:32:56,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:32:56,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:56,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:56,502 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:32:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:56,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716591952] [2025-03-09 00:32:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716591952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:32:56,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454169076] [2025-03-09 00:32:56,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:56,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:32:56,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:56,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:32:56,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:32:56,504 INFO L87 Difference]: Start difference. First operand 1568 states and 1973 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:32:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:56,573 INFO L93 Difference]: Finished difference Result 1493 states and 1870 transitions. [2025-03-09 00:32:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:32:56,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-03-09 00:32:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:56,577 INFO L225 Difference]: With dead ends: 1493 [2025-03-09 00:32:56,577 INFO L226 Difference]: Without dead ends: 1493 [2025-03-09 00:32:56,578 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:32:56,578 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 60 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:56,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2629 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:32:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-03-09 00:32:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2025-03-09 00:32:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1002 states have (on average 1.8343313373253494) internal successors, (1838), 1484 states have internal predecessors, (1838), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1870 transitions. [2025-03-09 00:32:56,597 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1870 transitions. Word has length 10 [2025-03-09 00:32:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1870 transitions. [2025-03-09 00:32:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:32:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1870 transitions. [2025-03-09 00:32:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 00:32:56,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:56,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:32:56,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:32:56,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:56,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1118976048, now seen corresponding path program 1 times [2025-03-09 00:32:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606148406] [2025-03-09 00:32:56,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:56,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:32:56,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:32:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:56,655 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:32:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606148406] [2025-03-09 00:32:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606148406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:32:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180362558] [2025-03-09 00:32:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:56,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:32:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:56,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:32:56,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:32:56,657 INFO L87 Difference]: Start difference. First operand 1493 states and 1870 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:32:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:56,756 INFO L93 Difference]: Finished difference Result 1475 states and 1845 transitions. [2025-03-09 00:32:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:32:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-09 00:32:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:56,761 INFO L225 Difference]: With dead ends: 1475 [2025-03-09 00:32:56,761 INFO L226 Difference]: Without dead ends: 1475 [2025-03-09 00:32:56,761 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:32:56,762 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 41 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:56,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3890 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:32:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2025-03-09 00:32:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1472. [2025-03-09 00:32:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 988 states have (on average 1.8319838056680162) internal successors, (1810), 1463 states have internal predecessors, (1810), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 1842 transitions. [2025-03-09 00:32:56,781 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 1842 transitions. Word has length 11 [2025-03-09 00:32:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:56,782 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 1842 transitions. [2025-03-09 00:32:56,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:32:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1842 transitions. [2025-03-09 00:32:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 00:32:56,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:56,782 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] [2025-03-09 00:32:56,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:32:56,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr584REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -262449338, now seen corresponding path program 1 times [2025-03-09 00:32:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125584067] [2025-03-09 00:32:56,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:56,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:32:56,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:32:56,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:56,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:56,934 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:32:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125584067] [2025-03-09 00:32:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125584067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:32:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857139928] [2025-03-09 00:32:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:56,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:32:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:56,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:32:56,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:32:56,938 INFO L87 Difference]: Start difference. First operand 1472 states and 1842 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:32:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:57,859 INFO L93 Difference]: Finished difference Result 1669 states and 1933 transitions. [2025-03-09 00:32:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:32:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-09 00:32:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:57,863 INFO L225 Difference]: With dead ends: 1669 [2025-03-09 00:32:57,863 INFO L226 Difference]: Without dead ends: 1669 [2025-03-09 00:32:57,863 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:32:57,864 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 821 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:57,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2479 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:32:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-09 00:32:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1468. [2025-03-09 00:32:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 988 states have (on average 1.8279352226720649) internal successors, (1806), 1459 states have internal predecessors, (1806), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1838 transitions. [2025-03-09 00:32:57,882 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1838 transitions. Word has length 25 [2025-03-09 00:32:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:57,883 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1838 transitions. [2025-03-09 00:32:57,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:32:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1838 transitions. [2025-03-09 00:32:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 00:32:57,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:57,884 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] [2025-03-09 00:32:57,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:32:57,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:57,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1124785146, now seen corresponding path program 1 times [2025-03-09 00:32:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991453209] [2025-03-09 00:32:57,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:57,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 00:32:57,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 00:32:57,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:57,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:57,967 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:32:57,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991453209] [2025-03-09 00:32:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991453209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:57,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:32:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496221346] [2025-03-09 00:32:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:32:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:57,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:32:57,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:32:57,968 INFO L87 Difference]: Start difference. First operand 1468 states and 1838 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:32:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:58,056 INFO L93 Difference]: Finished difference Result 1468 states and 1834 transitions. [2025-03-09 00:32:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:32:58,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-09 00:32:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:58,060 INFO L225 Difference]: With dead ends: 1468 [2025-03-09 00:32:58,060 INFO L226 Difference]: Without dead ends: 1468 [2025-03-09 00:32:58,060 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:32:58,060 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 21 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:58,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3872 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:32:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-09 00:32:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-03-09 00:32:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 988 states have (on average 1.8238866396761133) internal successors, (1802), 1459 states have internal predecessors, (1802), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1834 transitions. [2025-03-09 00:32:58,075 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1834 transitions. Word has length 59 [2025-03-09 00:32:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1834 transitions. [2025-03-09 00:32:58,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:32:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1834 transitions. [2025-03-09 00:32:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 00:32:58,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:58,077 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] [2025-03-09 00:32:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:32:58,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:58,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1126924994, now seen corresponding path program 1 times [2025-03-09 00:32:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249628812] [2025-03-09 00:32:58,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:58,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 00:32:58,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 00:32:58,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:58,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:32:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249628812] [2025-03-09 00:32:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249628812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:58,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:32:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553352787] [2025-03-09 00:32:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:58,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:32:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:58,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:32:58,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:32:58,155 INFO L87 Difference]: Start difference. First operand 1468 states and 1834 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:32:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:58,232 INFO L93 Difference]: Finished difference Result 1558 states and 1951 transitions. [2025-03-09 00:32:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:32:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-03-09 00:32:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:58,236 INFO L225 Difference]: With dead ends: 1558 [2025-03-09 00:32:58,236 INFO L226 Difference]: Without dead ends: 1558 [2025-03-09 00:32:58,236 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:32:58,237 INFO L435 NwaCegarLoop]: 1315 mSDtfsCounter, 54 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:58,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2603 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:32:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-03-09 00:32:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2025-03-09 00:32:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1078 states have (on average 1.780148423005566) internal successors, (1919), 1549 states have internal predecessors, (1919), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1951 transitions. [2025-03-09 00:32:58,253 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1951 transitions. Word has length 67 [2025-03-09 00:32:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:58,253 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1951 transitions. [2025-03-09 00:32:58,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:32:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1951 transitions. [2025-03-09 00:32:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 00:32:58,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:58,254 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] [2025-03-09 00:32:58,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:32:58,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr540REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:58,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1537810994, now seen corresponding path program 1 times [2025-03-09 00:32:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132783046] [2025-03-09 00:32:58,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:58,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 00:32:58,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 00:32:58,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:32:58,705 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:32:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:32:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132783046] [2025-03-09 00:32:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132783046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:32:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:32:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:32:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780201265] [2025-03-09 00:32:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:32:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:32:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:32:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:32:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:32:58,708 INFO L87 Difference]: Start difference. First operand 1558 states and 1951 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:32:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:32:59,882 INFO L93 Difference]: Finished difference Result 1474 states and 1867 transitions. [2025-03-09 00:32:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:32:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2025-03-09 00:32:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:32:59,885 INFO L225 Difference]: With dead ends: 1474 [2025-03-09 00:32:59,885 INFO L226 Difference]: Without dead ends: 1474 [2025-03-09 00:32:59,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:32:59,885 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 2242 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:32:59,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 1597 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:32:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-03-09 00:32:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1203. [2025-03-09 00:32:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 807 states have (on average 1.6765799256505576) internal successors, (1353), 1194 states have internal predecessors, (1353), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:32:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1385 transitions. [2025-03-09 00:32:59,898 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1385 transitions. Word has length 70 [2025-03-09 00:32:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:32:59,898 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1385 transitions. [2025-03-09 00:32:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:32:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1385 transitions. [2025-03-09 00:32:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 00:32:59,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:32:59,899 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] [2025-03-09 00:32:59,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:32:59,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr533REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:32:59,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:32:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1788834510, now seen corresponding path program 1 times [2025-03-09 00:32:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:32:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875743814] [2025-03-09 00:32:59,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:32:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:32:59,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 00:32:59,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:32:59,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:32:59,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:00,087 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:33:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875743814] [2025-03-09 00:33:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875743814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:33:00,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432552330] [2025-03-09 00:33:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:33:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:00,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:33:00,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:33:00,089 INFO L87 Difference]: Start difference. First operand 1203 states and 1385 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 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:33:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:00,736 INFO L93 Difference]: Finished difference Result 1202 states and 1384 transitions. [2025-03-09 00:33:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:33:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2025-03-09 00:33:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:00,743 INFO L225 Difference]: With dead ends: 1202 [2025-03-09 00:33:00,743 INFO L226 Difference]: Without dead ends: 1202 [2025-03-09 00:33:00,744 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:33:00,745 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 2 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:00,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3448 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:33:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-03-09 00:33:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1202. [2025-03-09 00:33:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 807 states have (on average 1.6753407682775712) internal successors, (1352), 1193 states have internal predecessors, (1352), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:33:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1384 transitions. [2025-03-09 00:33:00,759 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1384 transitions. Word has length 75 [2025-03-09 00:33:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:00,761 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1384 transitions. [2025-03-09 00:33:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 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:33:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1384 transitions. [2025-03-09 00:33:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 00:33:00,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:00,762 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] [2025-03-09 00:33:00,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:33:00,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1788834511, now seen corresponding path program 1 times [2025-03-09 00:33:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937475728] [2025-03-09 00:33:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:00,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 00:33:00,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:33:00,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:00,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:01,089 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:33:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:01,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937475728] [2025-03-09 00:33:01,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937475728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:33:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96424483] [2025-03-09 00:33:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:01,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:33:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:01,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:33:01,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:33:01,092 INFO L87 Difference]: Start difference. First operand 1202 states and 1384 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 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:33:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:01,854 INFO L93 Difference]: Finished difference Result 1201 states and 1383 transitions. [2025-03-09 00:33:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:33:01,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2025-03-09 00:33:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:01,857 INFO L225 Difference]: With dead ends: 1201 [2025-03-09 00:33:01,857 INFO L226 Difference]: Without dead ends: 1201 [2025-03-09 00:33:01,857 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:33:01,857 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 1 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:01,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3463 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:33:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-09 00:33:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2025-03-09 00:33:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 806 states have (on average 1.6761786600496278) internal successors, (1351), 1192 states have internal predecessors, (1351), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:33:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1383 transitions. [2025-03-09 00:33:01,868 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1383 transitions. Word has length 75 [2025-03-09 00:33:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:01,868 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1383 transitions. [2025-03-09 00:33:01,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 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:33:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1383 transitions. [2025-03-09 00:33:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 00:33:01,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:01,869 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] [2025-03-09 00:33:01,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:33:01,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:01,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1097736619, now seen corresponding path program 1 times [2025-03-09 00:33:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864403526] [2025-03-09 00:33:01,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:01,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 00:33:01,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 00:33:01,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:01,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:02,023 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:33:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864403526] [2025-03-09 00:33:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864403526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:33:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965560133] [2025-03-09 00:33:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:02,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:33:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:02,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:33:02,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:33:02,026 INFO L87 Difference]: Start difference. First operand 1201 states and 1383 transitions. Second operand has 7 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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:33:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:03,083 INFO L93 Difference]: Finished difference Result 1213 states and 1401 transitions. [2025-03-09 00:33:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:33:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 83 [2025-03-09 00:33:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:03,087 INFO L225 Difference]: With dead ends: 1213 [2025-03-09 00:33:03,087 INFO L226 Difference]: Without dead ends: 1213 [2025-03-09 00:33:03,087 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:33:03,087 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 12 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5333 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:03,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5333 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:33:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-09 00:33:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1207. [2025-03-09 00:33:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 811 states have (on average 1.6744759556103577) internal successors, (1358), 1197 states have internal predecessors, (1358), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-09 00:33:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1396 transitions. [2025-03-09 00:33:03,120 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1396 transitions. Word has length 83 [2025-03-09 00:33:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:03,120 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1396 transitions. [2025-03-09 00:33:03,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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:33:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1396 transitions. [2025-03-09 00:33:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 00:33:03,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:03,122 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] [2025-03-09 00:33:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:33:03,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1097736620, now seen corresponding path program 1 times [2025-03-09 00:33:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225679393] [2025-03-09 00:33:03,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:03,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 00:33:03,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 00:33:03,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:03,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:03,468 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:33:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225679393] [2025-03-09 00:33:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225679393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:03,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:03,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:33:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212346462] [2025-03-09 00:33:03,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:03,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:33:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:03,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:33:03,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:33:03,470 INFO L87 Difference]: Start difference. First operand 1207 states and 1396 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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:33:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:04,574 INFO L93 Difference]: Finished difference Result 1207 states and 1395 transitions. [2025-03-09 00:33:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:33:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 83 [2025-03-09 00:33:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:04,577 INFO L225 Difference]: With dead ends: 1207 [2025-03-09 00:33:04,578 INFO L226 Difference]: Without dead ends: 1207 [2025-03-09 00:33:04,579 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:33:04,579 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 7 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4393 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:04,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4393 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:33:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-03-09 00:33:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1207. [2025-03-09 00:33:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 811 states have (on average 1.6732429099876696) internal successors, (1357), 1197 states have internal predecessors, (1357), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-09 00:33:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1395 transitions. [2025-03-09 00:33:04,596 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1395 transitions. Word has length 83 [2025-03-09 00:33:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:04,597 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1395 transitions. [2025-03-09 00:33:04,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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:33:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1395 transitions. [2025-03-09 00:33:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 00:33:04,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:04,597 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] [2025-03-09 00:33:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:33:04,598 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:04,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1351444407, now seen corresponding path program 1 times [2025-03-09 00:33:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:04,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525932501] [2025-03-09 00:33:04,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:04,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:33:04,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:33:04,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:04,977 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:33:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525932501] [2025-03-09 00:33:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525932501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110259772] [2025-03-09 00:33:04,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:04,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:04,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:04,981 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:33:04,983 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:33:05,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:33:05,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:33:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:05,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 00:33:05,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:05,183 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:33:05,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:05,277 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:33:05,289 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:33:05,350 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:05,351 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:33:05,378 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:33:05,382 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:33:05,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:05,428 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-09 00:33:05,428 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:33:05,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-09 00:33:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110259772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:05,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:05,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-09 00:33:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810016244] [2025-03-09 00:33:05,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:33:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:05,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:33:05,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-03-09 00:33:05,443 INFO L87 Difference]: Start difference. First operand 1207 states and 1395 transitions. Second operand has 14 states, 12 states have (on average 9.916666666666666) internal successors, (119), 13 states have internal predecessors, (119), 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:33:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:07,616 INFO L93 Difference]: Finished difference Result 1206 states and 1394 transitions. [2025-03-09 00:33:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:33:07,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.916666666666666) internal successors, (119), 13 states have internal predecessors, (119), 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 84 [2025-03-09 00:33:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:07,619 INFO L225 Difference]: With dead ends: 1206 [2025-03-09 00:33:07,619 INFO L226 Difference]: Without dead ends: 1206 [2025-03-09 00:33:07,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:33:07,622 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1164 mSDsluCounter, 6987 mSDsCounter, 0 mSdLazyCounter, 6080 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 7724 SdHoareTripleChecker+Invalid, 6111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:07,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 7724 Invalid, 6111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6080 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:33:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-03-09 00:33:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2025-03-09 00:33:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 811 states have (on average 1.6720098643649814) internal successors, (1356), 1196 states have internal predecessors, (1356), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-09 00:33:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1394 transitions. [2025-03-09 00:33:07,637 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1394 transitions. Word has length 84 [2025-03-09 00:33:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:07,637 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1394 transitions. [2025-03-09 00:33:07,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.916666666666666) internal successors, (119), 13 states have internal predecessors, (119), 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:33:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1394 transitions. [2025-03-09 00:33:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 00:33:07,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:07,638 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] [2025-03-09 00:33:07,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:33:07,843 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,SelfDestructingSolverStorable15 [2025-03-09 00:33:07,843 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1351444408, now seen corresponding path program 1 times [2025-03-09 00:33:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824356728] [2025-03-09 00:33:07,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:07,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:33:07,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:33:07,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:08,358 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:33:08,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:08,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824356728] [2025-03-09 00:33:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824356728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:08,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181871371] [2025-03-09 00:33:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:08,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:08,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:08,361 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:33:08,362 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:33:08,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:33:08,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:33:08,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:08,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:08,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:33:08,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:08,528 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:33:08,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:08,615 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:33:08,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:33:08,634 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:33:08,640 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:33:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-09 00:33:08,703 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:33:08,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:08,792 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:33:08,797 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:33:08,821 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:33:08,824 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:33:08,827 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:33:08,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:08,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_633 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_633 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2025-03-09 00:33:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181871371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:08,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-09 00:33:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262087383] [2025-03-09 00:33:08,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:33:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:08,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:33:08,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-09 00:33:08,901 INFO L87 Difference]: Start difference. First operand 1206 states and 1394 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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:33:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:11,059 INFO L93 Difference]: Finished difference Result 1213 states and 1401 transitions. [2025-03-09 00:33:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:33:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 84 [2025-03-09 00:33:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:11,062 INFO L225 Difference]: With dead ends: 1213 [2025-03-09 00:33:11,062 INFO L226 Difference]: Without dead ends: 1213 [2025-03-09 00:33:11,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:33:11,063 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1157 mSDsluCounter, 4224 mSDsCounter, 0 mSdLazyCounter, 5113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 5144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:11,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 4966 Invalid, 5144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5113 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-09 00:33:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-09 00:33:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1204. [2025-03-09 00:33:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 810 states have (on average 1.671604938271605) internal successors, (1354), 1194 states have internal predecessors, (1354), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:33:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1386 transitions. [2025-03-09 00:33:11,083 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1386 transitions. Word has length 84 [2025-03-09 00:33:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:11,083 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1386 transitions. [2025-03-09 00:33:11,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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:33:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1386 transitions. [2025-03-09 00:33:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 00:33:11,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:11,085 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] [2025-03-09 00:33:11,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:33:11,290 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,SelfDestructingSolverStorable16 [2025-03-09 00:33:11,290 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 791940511, now seen corresponding path program 1 times [2025-03-09 00:33:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135186551] [2025-03-09 00:33:11,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:11,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 00:33:11,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 00:33:11,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:11,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:11,656 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:33:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135186551] [2025-03-09 00:33:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135186551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:11,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:11,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 00:33:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827369405] [2025-03-09 00:33:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:11,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:33:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:11,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:33:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:33:11,658 INFO L87 Difference]: Start difference. First operand 1204 states and 1386 transitions. Second operand has 14 states, 12 states have (on average 7.0) internal successors, (84), 13 states have internal predecessors, (84), 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:33:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:13,495 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-03-09 00:33:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:33:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.0) internal successors, (84), 13 states have internal predecessors, (84), 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 86 [2025-03-09 00:33:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:13,498 INFO L225 Difference]: With dead ends: 1217 [2025-03-09 00:33:13,498 INFO L226 Difference]: Without dead ends: 1217 [2025-03-09 00:33:13,499 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:33:13,499 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1185 mSDsluCounter, 6314 mSDsCounter, 0 mSdLazyCounter, 5571 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 7050 SdHoareTripleChecker+Invalid, 5601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:13,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 7050 Invalid, 5601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5571 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:33:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-09 00:33:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1213. [2025-03-09 00:33:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 818 states have (on average 1.667481662591687) internal successors, (1364), 1202 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1397 transitions. [2025-03-09 00:33:13,511 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1397 transitions. Word has length 86 [2025-03-09 00:33:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:13,511 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1397 transitions. [2025-03-09 00:33:13,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.0) internal successors, (84), 13 states have internal predecessors, (84), 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:33:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1397 transitions. [2025-03-09 00:33:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 00:33:13,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:13,512 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] [2025-03-09 00:33:13,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:33:13,512 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:13,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash 791940512, now seen corresponding path program 1 times [2025-03-09 00:33:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:13,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694681588] [2025-03-09 00:33:13,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:13,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 00:33:13,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 00:33:13,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:13,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:13,940 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:33:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:13,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694681588] [2025-03-09 00:33:13,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694681588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:13,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:13,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:33:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583260006] [2025-03-09 00:33:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:13,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:33:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:13,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:33:13,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:33:13,942 INFO L87 Difference]: Start difference. First operand 1213 states and 1397 transitions. Second operand has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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:33:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:15,647 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-03-09 00:33:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:33:15,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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 86 [2025-03-09 00:33:15,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:15,650 INFO L225 Difference]: With dead ends: 1216 [2025-03-09 00:33:15,650 INFO L226 Difference]: Without dead ends: 1216 [2025-03-09 00:33:15,650 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:33:15,651 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 1165 mSDsluCounter, 3523 mSDsCounter, 0 mSdLazyCounter, 4566 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 4266 SdHoareTripleChecker+Invalid, 4595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:15,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 4266 Invalid, 4595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4566 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 00:33:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-09 00:33:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1213. [2025-03-09 00:33:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 818 states have (on average 1.6662591687041566) internal successors, (1363), 1202 states have internal predecessors, (1363), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1396 transitions. [2025-03-09 00:33:15,661 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1396 transitions. Word has length 86 [2025-03-09 00:33:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:15,662 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1396 transitions. [2025-03-09 00:33:15,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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:33:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1396 transitions. [2025-03-09 00:33:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:33:15,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:15,662 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:33:15,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:33:15,663 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:15,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash -141788141, now seen corresponding path program 1 times [2025-03-09 00:33:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956110435] [2025-03-09 00:33:15,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:15,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:33:15,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:33:15,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:15,986 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:33:15,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:15,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956110435] [2025-03-09 00:33:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956110435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:15,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312861317] [2025-03-09 00:33:15,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:15,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:15,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:15,989 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:33:15,990 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:33:16,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:33:16,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:33:16,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:16,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 00:33:16,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:16,180 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:33:16,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:16,361 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:33:16,380 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:33:16,386 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:33:16,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:16,514 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:33:16,517 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:33:16,557 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 19 treesize of output 7 [2025-03-09 00:33:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:33:16,584 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 35 treesize of output 28 [2025-03-09 00:33:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:33:16,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:33:16,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 16 [2025-03-09 00:33:16,641 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:33:16,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:18,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem52#1.offset_11| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_11| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_#t~mem52#1.base| Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_#t~mem52#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_11| 16) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) 1))))) is different from false [2025-03-09 00:33:18,471 INFO L349 Elim1Store]: treesize reduction 5, result has 83.3 percent of original size [2025-03-09 00:33:18,471 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 34 treesize of output 33 [2025-03-09 00:33:18,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem52#1.offset_11| Int) (v_ArrVal_890 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.base| Int) (v_ArrVal_891 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_11| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_890))) (store .cse1 |ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse1 |ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_11| 16) |c_ULTIMATE.start_main_~user~0#1.base|))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2025-03-09 00:33:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312861317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:18,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-03-09 00:33:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906350028] [2025-03-09 00:33:18,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:33:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:18,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:33:18,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=570, Unknown=2, NotChecked=98, Total=756 [2025-03-09 00:33:18,485 INFO L87 Difference]: Start difference. First operand 1213 states and 1396 transitions. Second operand has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 23 states have internal predecessors, (167), 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:33:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:21,836 INFO L93 Difference]: Finished difference Result 1761 states and 2038 transitions. [2025-03-09 00:33:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:33:21,837 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 23 states have internal predecessors, (167), 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 87 [2025-03-09 00:33:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:21,840 INFO L225 Difference]: With dead ends: 1761 [2025-03-09 00:33:21,840 INFO L226 Difference]: Without dead ends: 1761 [2025-03-09 00:33:21,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=181, Invalid=1015, Unknown=2, NotChecked=134, Total=1332 [2025-03-09 00:33:21,842 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1788 mSDsluCounter, 10220 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 10956 SdHoareTripleChecker+Invalid, 8812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:21,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 10956 Invalid, 8812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2025-03-09 00:33:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-09 00:33:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1212. [2025-03-09 00:33:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 818 states have (on average 1.6650366748166259) internal successors, (1362), 1201 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1395 transitions. [2025-03-09 00:33:21,854 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1395 transitions. Word has length 87 [2025-03-09 00:33:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:21,854 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1395 transitions. [2025-03-09 00:33:21,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.590909090909091) internal successors, (167), 23 states have internal predecessors, (167), 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:33:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1395 transitions. [2025-03-09 00:33:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:33:21,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:21,855 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:33:21,862 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:33:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:22,056 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -141788140, now seen corresponding path program 1 times [2025-03-09 00:33:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399855771] [2025-03-09 00:33:22,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:33:22,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:33:22,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:22,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:22,499 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:33:22,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:22,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399855771] [2025-03-09 00:33:22,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399855771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:22,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732222321] [2025-03-09 00:33:22,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:22,502 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:33:22,504 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:33:22,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:33:22,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:33:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:22,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 00:33:22,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:22,686 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:33:22,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:22,764 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:33:22,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:33:22,788 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:33:22,791 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:33:22,852 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:33:22,855 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:33:22,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:22,928 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:33:22,931 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:33:23,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:23,009 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:33:23,015 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:33:23,027 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:33:23,030 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:33:23,044 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:33:23,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:23,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1028 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1028) |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~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:33:23,094 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_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1028 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-03-09 00:33:23,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1034))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-03-09 00:33:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732222321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:23,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:23,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-09 00:33:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332845581] [2025-03-09 00:33:23,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:23,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:33:23,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:23,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:33:23,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2025-03-09 00:33:23,133 INFO L87 Difference]: Start difference. First operand 1212 states and 1395 transitions. Second operand has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 20 states have internal predecessors, (137), 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:33:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:26,694 INFO L93 Difference]: Finished difference Result 1214 states and 1402 transitions. [2025-03-09 00:33:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:33:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 20 states have internal predecessors, (137), 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 87 [2025-03-09 00:33:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:26,696 INFO L225 Difference]: With dead ends: 1214 [2025-03-09 00:33:26,696 INFO L226 Difference]: Without dead ends: 1214 [2025-03-09 00:33:26,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2025-03-09 00:33:26,697 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1158 mSDsluCounter, 6865 mSDsCounter, 0 mSdLazyCounter, 8755 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 7606 SdHoareTripleChecker+Invalid, 8789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 8755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:26,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 7606 Invalid, 8789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 8755 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-09 00:33:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-09 00:33:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1202. [2025-03-09 00:33:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 810 states have (on average 1.6691358024691358) internal successors, (1352), 1192 states have internal predecessors, (1352), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:33:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1384 transitions. [2025-03-09 00:33:26,707 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1384 transitions. Word has length 87 [2025-03-09 00:33:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:26,707 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1384 transitions. [2025-03-09 00:33:26,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.058823529411764) internal successors, (137), 20 states have internal predecessors, (137), 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:33:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1384 transitions. [2025-03-09 00:33:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 00:33:26,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:26,707 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] [2025-03-09 00:33:26,714 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:33:26,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:26,908 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash 445714949, now seen corresponding path program 1 times [2025-03-09 00:33:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580627926] [2025-03-09 00:33:26,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:26,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 00:33:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 00:33:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:27,359 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:33:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580627926] [2025-03-09 00:33:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580627926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:27,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:33:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571893731] [2025-03-09 00:33:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:33:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:27,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:33:27,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:33:27,362 INFO L87 Difference]: Start difference. First operand 1202 states and 1384 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 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:33:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:29,195 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2025-03-09 00:33:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:33:29,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 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 89 [2025-03-09 00:33:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:29,200 INFO L225 Difference]: With dead ends: 1218 [2025-03-09 00:33:29,200 INFO L226 Difference]: Without dead ends: 1218 [2025-03-09 00:33:29,200 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:33:29,201 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1186 mSDsluCounter, 3525 mSDsCounter, 0 mSdLazyCounter, 4565 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:29,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 4267 Invalid, 4594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4565 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:33:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-09 00:33:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1214. [2025-03-09 00:33:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 821 states have (on average 1.6626065773447016) internal successors, (1365), 1203 states have internal predecessors, (1365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1398 transitions. [2025-03-09 00:33:29,209 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1398 transitions. Word has length 89 [2025-03-09 00:33:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:29,210 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1398 transitions. [2025-03-09 00:33:29,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 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:33:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1398 transitions. [2025-03-09 00:33:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 00:33:29,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:29,210 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] [2025-03-09 00:33:29,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 00:33:29,210 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash 445714948, now seen corresponding path program 1 times [2025-03-09 00:33:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:29,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232340654] [2025-03-09 00:33:29,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:29,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 00:33:29,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 00:33:29,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:29,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:29,532 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:33:29,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232340654] [2025-03-09 00:33:29,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232340654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:29,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:29,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:33:29,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317695462] [2025-03-09 00:33:29,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:29,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:33:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:29,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:33:29,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:33:29,534 INFO L87 Difference]: Start difference. First operand 1214 states and 1398 transitions. Second operand has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 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:33:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:30,907 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-03-09 00:33:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:33:30,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 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 89 [2025-03-09 00:33:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:30,910 INFO L225 Difference]: With dead ends: 1217 [2025-03-09 00:33:30,910 INFO L226 Difference]: Without dead ends: 1217 [2025-03-09 00:33:30,910 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:33:30,910 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1185 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:30,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 4955 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3918 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:33:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-09 00:33:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1214. [2025-03-09 00:33:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 821 states have (on average 1.661388550548112) internal successors, (1364), 1203 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1397 transitions. [2025-03-09 00:33:30,919 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1397 transitions. Word has length 89 [2025-03-09 00:33:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:30,919 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1397 transitions. [2025-03-09 00:33:30,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 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:33:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1397 transitions. [2025-03-09 00:33:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:33:30,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:30,920 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:33:30,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 00:33:30,920 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:30,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2056347887, now seen corresponding path program 1 times [2025-03-09 00:33:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291192983] [2025-03-09 00:33:30,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:30,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:33:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:33:30,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:30,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:31,396 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:33:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291192983] [2025-03-09 00:33:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291192983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856474473] [2025-03-09 00:33:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:31,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:31,398 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:33:31,400 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:33:31,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:33:31,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:33:31,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:31,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:31,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 00:33:31,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:31,593 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:33:31,693 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:31,694 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:33:31,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:33:31,741 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:33:31,744 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:33:31,791 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:33:31,794 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:33:31,884 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:31,884 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:33:31,894 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:33:31,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:31,942 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:33:31,947 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:33:31,985 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:31,985 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:33:31,988 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:33:32,001 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:33:32,005 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:33:32,019 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:33:32,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:32,109 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_1314 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1314 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:33:32,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1313))) (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~mem52#1.base| v_ArrVal_1312) .cse1 v_ArrVal_1314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-09 00:33:32,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1320 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1321))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1313))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1320) .cse0 v_ArrVal_1312) .cse1 v_ArrVal_1314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1320 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1321))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1320) .cse5 v_ArrVal_1312) (select (select (store .cse6 .cse5 v_ArrVal_1313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1314))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2025-03-09 00:33:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856474473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:32,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-09 00:33:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146258201] [2025-03-09 00:33:32,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:32,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:33:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:32,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:33:32,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=544, Unknown=21, NotChecked=150, Total=812 [2025-03-09 00:33:32,214 INFO L87 Difference]: Start difference. First operand 1214 states and 1397 transitions. Second operand has 22 states, 19 states have (on average 7.526315789473684) internal successors, (143), 22 states have internal predecessors, (143), 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:33:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:35,872 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-03-09 00:33:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:33:35,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.526315789473684) internal successors, (143), 22 states have internal predecessors, (143), 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 90 [2025-03-09 00:33:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:35,874 INFO L225 Difference]: With dead ends: 1216 [2025-03-09 00:33:35,874 INFO L226 Difference]: Without dead ends: 1216 [2025-03-09 00:33:35,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=827, Unknown=21, NotChecked=186, Total=1190 [2025-03-09 00:33:35,875 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1164 mSDsluCounter, 6675 mSDsCounter, 0 mSdLazyCounter, 8943 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 8992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 8943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:35,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 7415 Invalid, 8992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 8943 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-09 00:33:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-09 00:33:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1213. [2025-03-09 00:33:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 821 states have (on average 1.6601705237515225) internal successors, (1363), 1202 states have internal predecessors, (1363), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1396 transitions. [2025-03-09 00:33:35,884 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1396 transitions. Word has length 90 [2025-03-09 00:33:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:35,884 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1396 transitions. [2025-03-09 00:33:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.526315789473684) internal successors, (143), 22 states have internal predecessors, (143), 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:33:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1396 transitions. [2025-03-09 00:33:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:33:35,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:35,885 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:33:35,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:33:36,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 00:33:36,086 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:36,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2056347888, now seen corresponding path program 1 times [2025-03-09 00:33:36,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:36,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206108695] [2025-03-09 00:33:36,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:36,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:33:36,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:33:36,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:36,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:36,468 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:33:36,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:36,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206108695] [2025-03-09 00:33:36,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206108695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:36,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338053115] [2025-03-09 00:33:36,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:36,471 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:33:36,473 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:33:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:33:36,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:33:36,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:36,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:36,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 00:33:36,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:36,662 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:33:36,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:36,721 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:33:36,726 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:33:36,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:36,785 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:33:36,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:36,815 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:33:36,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:36,842 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:33:36,849 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:33:36,850 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:33:36,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:36,873 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-09 00:33:36,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1466 (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~mem52#1.base| v_ArrVal_1466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:33:36,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1466 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1466))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:33:36,906 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-09 00:33:36,907 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:33:36,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_1470))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1466)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-09 00:33:36,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338053115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:36,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:36,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-09 00:33:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679867900] [2025-03-09 00:33:36,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:33:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:36,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:33:36,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=322, Unknown=7, NotChecked=156, Total=552 [2025-03-09 00:33:36,912 INFO L87 Difference]: Start difference. First operand 1213 states and 1396 transitions. Second operand has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 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:33:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:38,994 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2025-03-09 00:33:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:33:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 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 90 [2025-03-09 00:33:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:38,996 INFO L225 Difference]: With dead ends: 1215 [2025-03-09 00:33:38,996 INFO L226 Difference]: Without dead ends: 1215 [2025-03-09 00:33:38,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=637, Unknown=7, NotChecked=220, Total=992 [2025-03-09 00:33:38,996 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 1156 mSDsluCounter, 6979 mSDsCounter, 0 mSdLazyCounter, 6133 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 7714 SdHoareTripleChecker+Invalid, 6179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:38,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 7714 Invalid, 6179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6133 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:33:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-09 00:33:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1200. [2025-03-09 00:33:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 810 states have (on average 1.6666666666666667) internal successors, (1350), 1190 states have internal predecessors, (1350), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:33:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1382 transitions. [2025-03-09 00:33:39,005 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1382 transitions. Word has length 90 [2025-03-09 00:33:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1382 transitions. [2025-03-09 00:33:39,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 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:33:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1382 transitions. [2025-03-09 00:33:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 00:33:39,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:39,006 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] [2025-03-09 00:33:39,013 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:33:39,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:39,207 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:39,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1743561640, now seen corresponding path program 1 times [2025-03-09 00:33:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503529876] [2025-03-09 00:33:39,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:33:39,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:33:39,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:39,583 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:33:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503529876] [2025-03-09 00:33:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503529876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:39,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:39,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:33:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150638262] [2025-03-09 00:33:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:39,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:33:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:39,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:33:39,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:33:39,585 INFO L87 Difference]: Start difference. First operand 1200 states and 1382 transitions. Second operand has 16 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 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:33:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:41,301 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2025-03-09 00:33:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:33:41,301 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 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 92 [2025-03-09 00:33:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:41,303 INFO L225 Difference]: With dead ends: 1219 [2025-03-09 00:33:41,303 INFO L226 Difference]: Without dead ends: 1219 [2025-03-09 00:33:41,304 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:33:41,304 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1189 mSDsluCounter, 5570 mSDsCounter, 0 mSdLazyCounter, 5020 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 6304 SdHoareTripleChecker+Invalid, 5051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:41,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 6304 Invalid, 5051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5020 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 00:33:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-09 00:33:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1215. [2025-03-09 00:33:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 824 states have (on average 1.6577669902912622) internal successors, (1366), 1204 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1399 transitions. [2025-03-09 00:33:41,315 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1399 transitions. Word has length 92 [2025-03-09 00:33:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:41,315 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1399 transitions. [2025-03-09 00:33:41,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 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:33:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1399 transitions. [2025-03-09 00:33:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 00:33:41,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:41,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 00:33:41,316 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1743561639, now seen corresponding path program 1 times [2025-03-09 00:33:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614928030] [2025-03-09 00:33:41,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:41,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:33:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:33:41,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:41,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:41,826 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:33:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:41,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614928030] [2025-03-09 00:33:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614928030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:41,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 00:33:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114593248] [2025-03-09 00:33:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:33:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:41,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:33:41,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:33:41,830 INFO L87 Difference]: Start difference. First operand 1215 states and 1399 transitions. Second operand has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:33:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:43,762 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2025-03-09 00:33:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:33:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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 92 [2025-03-09 00:33:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:43,764 INFO L225 Difference]: With dead ends: 1218 [2025-03-09 00:33:43,764 INFO L226 Difference]: Without dead ends: 1218 [2025-03-09 00:33:43,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:33:43,764 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1167 mSDsluCounter, 4197 mSDsCounter, 0 mSdLazyCounter, 5129 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 4938 SdHoareTripleChecker+Invalid, 5158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:43,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 4938 Invalid, 5158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5129 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 00:33:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-09 00:33:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1215. [2025-03-09 00:33:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 824 states have (on average 1.6565533980582525) internal successors, (1365), 1204 states have internal predecessors, (1365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1398 transitions. [2025-03-09 00:33:43,772 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1398 transitions. Word has length 92 [2025-03-09 00:33:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:43,772 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1398 transitions. [2025-03-09 00:33:43,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:33:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1398 transitions. [2025-03-09 00:33:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:33:43,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:43,772 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:33:43,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 00:33:43,772 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:43,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1540086836, now seen corresponding path program 1 times [2025-03-09 00:33:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:43,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119659224] [2025-03-09 00:33:43,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:43,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:33:43,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:33:43,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:43,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:44,112 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:33:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119659224] [2025-03-09 00:33:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119659224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839890925] [2025-03-09 00:33:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:44,114 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:33:44,115 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:33:44,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:33:44,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:33:44,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:44,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:44,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 00:33:44,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:44,312 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:33:44,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:44,377 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:33:44,381 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:33:44,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:44,402 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 31 treesize of output 32 [2025-03-09 00:33:44,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:44,417 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 31 treesize of output 32 [2025-03-09 00:33:44,439 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:44,440 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:33:44,466 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:44,466 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:33:44,473 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:33:44,475 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:33:44,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:44,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1769) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-09 00:33:44,507 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-09 00:33:44,507 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:33:44,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int))) (= (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_1768))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem53#1.base|)) is different from false [2025-03-09 00:33:44,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1767 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1767)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1768))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2025-03-09 00:33:44,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1767 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1767))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1768))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2025-03-09 00:33:44,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1772 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1772))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1767)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_1768))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2025-03-09 00:33:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839890925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:44,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2025-03-09 00:33:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775272834] [2025-03-09 00:33:44,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:33:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:44,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:33:44,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=317, Unknown=11, NotChecked=200, Total=600 [2025-03-09 00:33:44,558 INFO L87 Difference]: Start difference. First operand 1215 states and 1398 transitions. Second operand has 18 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 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:33:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:46,370 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-03-09 00:33:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:33:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 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:33:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:46,372 INFO L225 Difference]: With dead ends: 1217 [2025-03-09 00:33:46,372 INFO L226 Difference]: Without dead ends: 1217 [2025-03-09 00:33:46,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=629, Unknown=11, NotChecked=280, Total=1056 [2025-03-09 00:33:46,372 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1152 mSDsluCounter, 5616 mSDsCounter, 0 mSdLazyCounter, 4991 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 6356 SdHoareTripleChecker+Invalid, 5021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:46,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 6356 Invalid, 5021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4991 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:33:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-09 00:33:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1214. [2025-03-09 00:33:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 824 states have (on average 1.6553398058252426) internal successors, (1364), 1203 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1397 transitions. [2025-03-09 00:33:46,380 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1397 transitions. Word has length 93 [2025-03-09 00:33:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1397 transitions. [2025-03-09 00:33:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 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:33:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1397 transitions. [2025-03-09 00:33:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:33:46,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:46,381 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:33:46,388 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:33:46,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:46,582 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:46,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1540086835, now seen corresponding path program 1 times [2025-03-09 00:33:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997340081] [2025-03-09 00:33:46,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:46,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:33:46,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:33:46,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:46,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:47,096 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:33:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997340081] [2025-03-09 00:33:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997340081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225721256] [2025-03-09 00:33:47,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:47,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:47,098 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:33:47,099 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:33:47,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:33:47,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:33:47,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:47,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:47,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 00:33:47,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:47,291 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:33:47,355 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:33:47,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:47,361 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:33:47,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 13 treesize of output 9 [2025-03-09 00:33:47,371 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:33:47,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 22 treesize of output 10 [2025-03-09 00:33:47,401 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:33:47,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:47,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:33:47,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:33:47,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:47,514 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:33:47,517 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:33:47,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:47,551 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:33:47,553 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:33:47,592 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:47,592 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:33:47,598 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:33:47,611 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:33:47,615 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:33:47,617 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:33:47,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:47,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1937 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-09 00:33:47,660 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_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1937 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-03-09 00:33:47,673 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1936))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1935) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1936) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-03-09 00:33:47,682 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_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1935) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1936) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1936))) (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_1935) .cse2 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:33:47,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1934))) (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~mem52#1.base| v_ArrVal_1933) .cse0 v_ArrVal_1935) (select (select (store .cse1 .cse0 v_ArrVal_1936) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1937))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1934))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1936))) (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~mem52#1.base| v_ArrVal_1933) .cse3 v_ArrVal_1935) .cse4 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-09 00:33:47,727 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_1934 (Array Int Int)) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1934))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1936))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1933) .cse1 v_ArrVal_1935) .cse2 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1934))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1933) .cse6 v_ArrVal_1935) (select (select (store .cse7 .cse6 v_ArrVal_1936) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1937))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-03-09 00:33:47,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1943))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1934))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1944) .cse0 v_ArrVal_1933) .cse1 v_ArrVal_1935) (select (select (store .cse2 .cse1 v_ArrVal_1936) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1937))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1943))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1934))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1936))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1944) .cse5 v_ArrVal_1933) .cse6 v_ArrVal_1935) .cse7 v_ArrVal_1937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-03-09 00:33:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225721256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:47,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-03-09 00:33:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932219831] [2025-03-09 00:33:47,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:47,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:33:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:47,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:33:47,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2025-03-09 00:33:47,802 INFO L87 Difference]: Start difference. First operand 1214 states and 1397 transitions. Second operand has 20 states, 18 states have (on average 7.722222222222222) internal successors, (139), 20 states have internal predecessors, (139), 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:33:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:50,524 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-03-09 00:33:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:33:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.722222222222222) internal successors, (139), 20 states have internal predecessors, (139), 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 93 [2025-03-09 00:33:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:50,526 INFO L225 Difference]: With dead ends: 1216 [2025-03-09 00:33:50,526 INFO L226 Difference]: Without dead ends: 1216 [2025-03-09 00:33:50,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2025-03-09 00:33:50,527 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1151 mSDsluCounter, 5428 mSDsCounter, 0 mSdLazyCounter, 6408 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 6167 SdHoareTripleChecker+Invalid, 6439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:50,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 6167 Invalid, 6439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6408 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-09 00:33:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-09 00:33:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1198. [2025-03-09 00:33:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 810 states have (on average 1.6641975308641976) internal successors, (1348), 1188 states have internal predecessors, (1348), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:33:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1380 transitions. [2025-03-09 00:33:50,535 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1380 transitions. Word has length 93 [2025-03-09 00:33:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:50,535 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1380 transitions. [2025-03-09 00:33:50,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.722222222222222) internal successors, (139), 20 states have internal predecessors, (139), 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:33:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1380 transitions. [2025-03-09 00:33:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:33:50,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:50,535 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:33:50,542 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:33:50,736 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,SelfDestructingSolverStorable28 [2025-03-09 00:33:50,736 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr513REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1849813650, now seen corresponding path program 1 times [2025-03-09 00:33:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632998987] [2025-03-09 00:33:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:33:50,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:33:50,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:50,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:33:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632998987] [2025-03-09 00:33:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632998987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:51,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 00:33:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618995989] [2025-03-09 00:33:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:51,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:33:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:51,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:33:51,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:33:51,208 INFO L87 Difference]: Start difference. First operand 1198 states and 1380 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 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:33:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:53,115 INFO L93 Difference]: Finished difference Result 1221 states and 1409 transitions. [2025-03-09 00:33:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:33:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 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:33:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:53,117 INFO L225 Difference]: With dead ends: 1221 [2025-03-09 00:33:53,117 INFO L226 Difference]: Without dead ends: 1221 [2025-03-09 00:33:53,117 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:33:53,117 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 1174 mSDsluCounter, 6264 mSDsCounter, 0 mSdLazyCounter, 5609 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 6997 SdHoareTripleChecker+Invalid, 5642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:53,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 6997 Invalid, 5642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 5609 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 00:33:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-09 00:33:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1217. [2025-03-09 00:33:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 828 states have (on average 1.6521739130434783) internal successors, (1368), 1206 states have internal predecessors, (1368), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1401 transitions. [2025-03-09 00:33:53,130 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1401 transitions. Word has length 96 [2025-03-09 00:33:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:53,130 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1401 transitions. [2025-03-09 00:33:53,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 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:33:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1401 transitions. [2025-03-09 00:33:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:33:53,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:53,130 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:33:53,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 00:33:53,131 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:53,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1849813651, now seen corresponding path program 1 times [2025-03-09 00:33:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495406204] [2025-03-09 00:33:53,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:53,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:33:53,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:33:53,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:53,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:53,862 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:33:53,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:53,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495406204] [2025-03-09 00:33:53,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495406204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:33:53,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:33:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 00:33:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150489832] [2025-03-09 00:33:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:33:53,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:33:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:53,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:33:53,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:33:53,863 INFO L87 Difference]: Start difference. First operand 1217 states and 1401 transitions. Second operand has 18 states, 16 states have (on average 5.875) internal successors, (94), 17 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:33:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:33:57,141 INFO L93 Difference]: Finished difference Result 1220 states and 1408 transitions. [2025-03-09 00:33:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:33:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.875) internal successors, (94), 17 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:33:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:33:57,143 INFO L225 Difference]: With dead ends: 1220 [2025-03-09 00:33:57,143 INFO L226 Difference]: Without dead ends: 1220 [2025-03-09 00:33:57,143 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:33:57,144 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1167 mSDsluCounter, 6922 mSDsCounter, 0 mSdLazyCounter, 8680 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 7656 SdHoareTripleChecker+Invalid, 8713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:33:57,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 7656 Invalid, 8713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 8680 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-09 00:33:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-03-09 00:33:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2025-03-09 00:33:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 828 states have (on average 1.6509661835748792) internal successors, (1367), 1206 states have internal predecessors, (1367), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:33:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1400 transitions. [2025-03-09 00:33:57,158 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1400 transitions. Word has length 96 [2025-03-09 00:33:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:33:57,158 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1400 transitions. [2025-03-09 00:33:57,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.875) internal successors, (94), 17 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:33:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1400 transitions. [2025-03-09 00:33:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:33:57,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:33:57,159 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:33:57,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 00:33:57,159 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr513REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:33:57,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:33:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1695143942, now seen corresponding path program 1 times [2025-03-09 00:33:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:33:57,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064384007] [2025-03-09 00:33:57,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:33:57,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:33:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:33:57,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:57,634 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:33:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:33:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064384007] [2025-03-09 00:33:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064384007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235324525] [2025-03-09 00:33:57,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:33:57,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:33:57,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:33:57,636 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:33:57,638 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:33:57,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:33:57,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:33:57,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:33:57,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:33:57,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:33:57,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:33:57,841 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:33:57,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:33:57,904 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:33:57,909 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:33:57,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:57,965 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:33:57,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:57,995 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:33:58,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:58,022 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:33:58,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:58,054 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:33:58,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:33:58,082 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:33:58,088 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:33:58,117 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:33:58,117 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:33:58,119 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:33:58,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:33:58,559 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-09 00:33:58,559 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:33:58,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235324525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:33:58,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:33:58,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2025-03-09 00:33:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530291295] [2025-03-09 00:33:58,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:33:58,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:33:58,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:33:58,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:33:58,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=983, Unknown=58, NotChecked=0, Total=1190 [2025-03-09 00:33:58,638 INFO L87 Difference]: Start difference. First operand 1217 states and 1400 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 24 states have internal predecessors, (147), 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:34:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:34:01,259 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2025-03-09 00:34:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:34:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 24 states have internal predecessors, (147), 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 97 [2025-03-09 00:34:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:34:01,262 INFO L225 Difference]: With dead ends: 1219 [2025-03-09 00:34:01,262 INFO L226 Difference]: Without dead ends: 1219 [2025-03-09 00:34:01,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1649, Unknown=58, NotChecked=0, Total=1980 [2025-03-09 00:34:01,262 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 1154 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 7267 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 9060 SdHoareTripleChecker+Invalid, 7313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 7267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:34:01,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 9060 Invalid, 7313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 7267 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-09 00:34:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-09 00:34:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1216. [2025-03-09 00:34:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 828 states have (on average 1.6497584541062802) internal successors, (1366), 1205 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-09 00:34:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1399 transitions. [2025-03-09 00:34:01,276 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1399 transitions. Word has length 97 [2025-03-09 00:34:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:34:01,276 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1399 transitions. [2025-03-09 00:34:01,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 24 states have internal predecessors, (147), 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:34:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1399 transitions. [2025-03-09 00:34:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:34:01,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:34:01,277 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:34:01,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 00:34:01,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:34:01,477 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:34:01,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:34:01,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1695143943, now seen corresponding path program 1 times [2025-03-09 00:34:01,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:34:01,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256528069] [2025-03-09 00:34:01,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:34:01,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:34:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:34:01,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:34:01,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:34:01,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:34:02,150 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:34:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:34:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256528069] [2025-03-09 00:34:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256528069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:34:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77784107] [2025-03-09 00:34:02,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:34:02,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:34:02,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:34:02,153 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:34:02,153 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:34:02,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:34:02,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:34:02,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:34:02,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:34:02,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-09 00:34:02,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:34:02,355 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:34:02,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:34:02,426 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:34:02,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:34:02,435 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:34:02,436 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:34:02,464 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:34:02,467 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:34:02,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:34:02,566 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:34:02,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:34:02,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:34:02,626 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:34:02,630 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:34:02,680 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:34:02,680 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:34:02,683 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:34:02,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:34:02,726 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:34:02,729 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:34:02,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:34:02,773 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:34:02,778 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:34:02,795 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:34:02,801 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:34:02,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:34:02,808 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:34:02,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:34:02,813 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:34:02,815 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:34:02,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:34:03,147 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2461) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2464 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2465 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2462))) (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_2461) .cse2 v_ArrVal_2463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2465) (select (select (store .cse3 .cse2 v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2025-03-09 00:34:03,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2460 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2460))) (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~mem53#1.base| v_ArrVal_2459) .cse0 v_ArrVal_2461) (select (select (store .cse1 .cse0 v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2463))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2459 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2464 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2460 (Array Int Int))) (or (forall ((v_ArrVal_2465 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2462))) (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~mem53#1.base| v_ArrVal_2459) .cse3 v_ArrVal_2461) .cse4 v_ArrVal_2463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2465) (select (select (store .cse5 .cse4 v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2025-03-09 00:34:03,194 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 (or (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2460 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2460))) (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_2459) .cse1 v_ArrVal_2461) (select (select (store .cse2 .cse1 v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2463))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2459 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2464 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2460 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2465 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2460))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2462))) (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_ArrVal_2459) .cse4 v_ArrVal_2461) .cse5 v_ArrVal_2463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2465) (select (select (store .cse6 .cse5 v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-03-09 00:34:03,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (Array Int Int)) (v_ArrVal_2457 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2460 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2458))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2460))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2457) .cse0 v_ArrVal_2459) .cse1 v_ArrVal_2461) (select (select (store .cse2 .cse1 v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2463))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (Array Int Int)) (v_ArrVal_2457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2464 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2460 (Array Int Int))) (or (forall ((v_ArrVal_2465 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2458))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2460))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2462))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2457) .cse5 v_ArrVal_2459) .cse6 v_ArrVal_2461) .cse7 v_ArrVal_2463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2465) (select (select (store .cse8 .cse7 v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2025-03-09 00:34:10,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:34:10,388 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 604 treesize of output 622 [2025-03-09 00:34:10,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (Array Int Int)) (v_ArrVal_2457 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2471 (Array Int Int)) (v_ArrVal_2460 (Array Int Int)) (v_ArrVal_2470 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2470))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2458))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2460))) (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~mem50#1.base| v_ArrVal_2471) .cse0 v_ArrVal_2457) .cse1 v_ArrVal_2459) .cse2 v_ArrVal_2461) (select (select (store .cse3 .cse2 v_ArrVal_2462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2463))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_2465 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_ArrVal_2464 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_prenex_18))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_prenex_25))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_22))) (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~mem50#1.base| v_prenex_24) .cse7 v_prenex_19) .cse8 v_prenex_17) .cse9 v_prenex_23) .cse10 v_prenex_21) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_20 v_ArrVal_2465) (select (select (store .cse11 .cse10 v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_20))))) is different from false [2025-03-09 00:34:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77784107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:34:10,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:34:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2025-03-09 00:34:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243985690] [2025-03-09 00:34:10,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:34:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 00:34:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:34:10,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 00:34:10,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=907, Unknown=22, NotChecked=330, Total=1406 [2025-03-09 00:34:10,821 INFO L87 Difference]: Start difference. First operand 1216 states and 1399 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 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)