./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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_OAT_test9-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 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:49:00,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:49:00,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:49:00,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:49:00,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:49:00,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:49:00,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:49:00,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:49:00,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:49:00,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:49:00,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:49:00,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:49:00,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:49:00,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:49:00,305 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:49:00,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:49:00,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:49:00,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:49:00,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:49:00,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:49:00,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:49:00,308 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 -> 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 [2025-03-17 13:49:00,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:49:00,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:49:00,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:49:00,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:49:00,526 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:49:00,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2025-03-17 13:49:01,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ade319c/d29eb77dbba04004b33cb46801171d5f/FLAGff3e61d08 [2025-03-17 13:49:02,014 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:49:02,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2025-03-17 13:49:02,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ade319c/d29eb77dbba04004b33cb46801171d5f/FLAGff3e61d08 [2025-03-17 13:49:02,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ade319c/d29eb77dbba04004b33cb46801171d5f [2025-03-17 13:49:02,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:49:02,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:49:02,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:49:02,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:49:02,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:49:02,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e9fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02, skipping insertion in model container [2025-03-17 13:49:02,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:49:02,524 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-17 13:49:02,536 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-17 13:49:02,539 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-17 13:49:02,543 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-17 13:49:02,546 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-17 13:49:02,563 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-17 13:49:02,563 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-17 13:49:02,564 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-17 13:49:02,565 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-17 13:49:02,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:49:02,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:49:02,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:49:02,702 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:49:02,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02 WrapperNode [2025-03-17 13:49:02,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:49:02,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:49:02,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:49:02,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:49:02,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,794 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-03-17 13:49:02,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:49:02,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:49:02,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:49:02,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:49:02,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,875 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-17 13:49:02,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:49:02,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:49:02,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:49:02,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:49:02,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (1/1) ... [2025-03-17 13:49:02,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:49:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:03,012 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-17 13:49:03,015 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-17 13:49:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 13:49:03,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 13:49:03,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:49:03,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 13:49:03,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 13:49:03,035 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:49:03,035 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:49:03,035 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:49:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:49:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:49:03,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:49:03,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:49:03,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:49:05,536 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 13:49:05,755 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2025-03-17 13:49:05,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:49:05,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:49:05,836 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 13:49:05,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:49:05 BoogieIcfgContainer [2025-03-17 13:49:05,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:49:05,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:49:05,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:49:05,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:49:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:49:02" (1/3) ... [2025-03-17 13:49:05,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f35e329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:49:05, skipping insertion in model container [2025-03-17 13:49:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:02" (2/3) ... [2025-03-17 13:49:05,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f35e329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:49:05, skipping insertion in model container [2025-03-17 13:49:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:49:05" (3/3) ... [2025-03-17 13:49:05,846 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-1.i [2025-03-17 13:49:05,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:49:05,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test9-1.i that has 6 procedures, 2069 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2025-03-17 13:49:05,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:49:05,934 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;@54bb1b51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:49:05,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-03-17 13:49:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 2059 states, 1129 states have (on average 2.009743135518158) internal successors, (2269), 2052 states have internal predecessors, (2269), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-17 13:49:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:49:05,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:05,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:49:05,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:05,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 139199, now seen corresponding path program 1 times [2025-03-17 13:49:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:05,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607976370] [2025-03-17 13:49:05,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:06,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:49:06,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:49:06,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:06,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:06,105 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-17 13:49:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607976370] [2025-03-17 13:49:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607976370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:06,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:06,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:49:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200569068] [2025-03-17 13:49:06,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:06,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:06,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:06,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:06,135 INFO L87 Difference]: Start difference. First operand has 2059 states, 1129 states have (on average 2.009743135518158) internal successors, (2269), 2052 states have internal predecessors, (2269), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 13:49:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:07,201 INFO L93 Difference]: Finished difference Result 2045 states and 3209 transitions. [2025-03-17 13:49:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:07,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 13:49:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:07,238 INFO L225 Difference]: With dead ends: 2045 [2025-03-17 13:49:07,238 INFO L226 Difference]: Without dead ends: 2043 [2025-03-17 13:49:07,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 13:49:07,241 INFO L435 NwaCegarLoop]: 2779 mSDtfsCounter, 2085 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2588 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:07,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2588 Valid, 2831 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:49:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-17 13:49:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2043. [2025-03-17 13:49:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 1131 states have (on average 1.9442970822281167) internal successors, (2199), 2036 states have internal predecessors, (2199), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 3207 transitions. [2025-03-17 13:49:07,557 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 3207 transitions. Word has length 2 [2025-03-17 13:49:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:07,557 INFO L471 AbstractCegarLoop]: Abstraction has 2043 states and 3207 transitions. [2025-03-17 13:49:07,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 13:49:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 3207 transitions. [2025-03-17 13:49:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:49:07,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:07,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:49:07,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:49:07,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:07,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 139200, now seen corresponding path program 1 times [2025-03-17 13:49:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048757581] [2025-03-17 13:49:07,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:07,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:07,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:49:07,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:49:07,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:07,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:07,643 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-17 13:49:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048757581] [2025-03-17 13:49:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048757581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:07,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:07,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:49:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916471258] [2025-03-17 13:49:07,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:07,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:07,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:07,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:07,646 INFO L87 Difference]: Start difference. First operand 2043 states and 3207 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 13:49:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:08,621 INFO L93 Difference]: Finished difference Result 2127 states and 3296 transitions. [2025-03-17 13:49:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:08,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 13:49:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:08,629 INFO L225 Difference]: With dead ends: 2127 [2025-03-17 13:49:08,629 INFO L226 Difference]: Without dead ends: 2127 [2025-03-17 13:49:08,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 13:49:08,629 INFO L435 NwaCegarLoop]: 2914 mSDtfsCounter, 1827 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:08,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 3141 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:49:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-03-17 13:49:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2079. [2025-03-17 13:49:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 1177 states have (on average 1.9371282922684792) internal successors, (2280), 2072 states have internal predecessors, (2280), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3288 transitions. [2025-03-17 13:49:08,751 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3288 transitions. Word has length 2 [2025-03-17 13:49:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3288 transitions. [2025-03-17 13:49:08,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 13:49:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3288 transitions. [2025-03-17 13:49:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 13:49:08,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:08,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 13:49:08,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:49:08,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:08,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -163972453, now seen corresponding path program 1 times [2025-03-17 13:49:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:08,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744362819] [2025-03-17 13:49:08,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:08,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 13:49:08,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 13:49:08,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:08,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:08,896 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-17 13:49:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744362819] [2025-03-17 13:49:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744362819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444409843] [2025-03-17 13:49:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:08,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:49:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:08,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:49:08,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:49:08,898 INFO L87 Difference]: Start difference. First operand 2079 states and 3288 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-17 13:49:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:12,704 INFO L93 Difference]: Finished difference Result 3384 states and 5670 transitions. [2025-03-17 13:49:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:49:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2025-03-17 13:49:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:12,717 INFO L225 Difference]: With dead ends: 3384 [2025-03-17 13:49:12,717 INFO L226 Difference]: Without dead ends: 3384 [2025-03-17 13:49:12,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:49:12,720 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 5631 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 1139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6131 SdHoareTripleChecker+Valid, 6940 SdHoareTripleChecker+Invalid, 4772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1139 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:12,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6131 Valid, 6940 Invalid, 4772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1139 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 13:49:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2025-03-17 13:49:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2031. [2025-03-17 13:49:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 1131 states have (on average 1.9328028293545534) internal successors, (2186), 2024 states have internal predecessors, (2186), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3194 transitions. [2025-03-17 13:49:12,881 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3194 transitions. Word has length 6 [2025-03-17 13:49:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:12,881 INFO L471 AbstractCegarLoop]: Abstraction has 2031 states and 3194 transitions. [2025-03-17 13:49:12,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-17 13:49:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3194 transitions. [2025-03-17 13:49:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 13:49:12,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:12,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:12,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:49:12,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -788174507, now seen corresponding path program 1 times [2025-03-17 13:49:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010354164] [2025-03-17 13:49:12,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:12,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 13:49:12,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 13:49:12,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:12,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:12,930 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-17 13:49:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010354164] [2025-03-17 13:49:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010354164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271593695] [2025-03-17 13:49:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:12,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:12,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:12,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:12,931 INFO L87 Difference]: Start difference. First operand 2031 states and 3194 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:13,833 INFO L93 Difference]: Finished difference Result 3291 states and 5532 transitions. [2025-03-17 13:49:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 13:49:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:13,845 INFO L225 Difference]: With dead ends: 3291 [2025-03-17 13:49:13,845 INFO L226 Difference]: Without dead ends: 3291 [2025-03-17 13:49:13,845 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-17 13:49:13,846 INFO L435 NwaCegarLoop]: 4927 mSDtfsCounter, 2059 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:13,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 7210 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:49:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2025-03-17 13:49:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 1984. [2025-03-17 13:49:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1131 states have (on average 1.8912466843501325) internal successors, (2139), 1977 states have internal predecessors, (2139), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 3147 transitions. [2025-03-17 13:49:14,022 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 3147 transitions. Word has length 7 [2025-03-17 13:49:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:14,022 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 3147 transitions. [2025-03-17 13:49:14,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 3147 transitions. [2025-03-17 13:49:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 13:49:14,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:14,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:14,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:49:14,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:14,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash -788174506, now seen corresponding path program 1 times [2025-03-17 13:49:14,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:14,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122431085] [2025-03-17 13:49:14,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:14,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:14,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 13:49:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 13:49:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:14,090 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-17 13:49:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122431085] [2025-03-17 13:49:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122431085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:14,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876318329] [2025-03-17 13:49:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:14,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:14,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:14,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:14,091 INFO L87 Difference]: Start difference. First operand 1984 states and 3147 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:14,893 INFO L93 Difference]: Finished difference Result 3271 states and 5511 transitions. [2025-03-17 13:49:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 13:49:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:14,904 INFO L225 Difference]: With dead ends: 3271 [2025-03-17 13:49:14,904 INFO L226 Difference]: Without dead ends: 3271 [2025-03-17 13:49:14,905 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-17 13:49:14,905 INFO L435 NwaCegarLoop]: 5070 mSDtfsCounter, 1852 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 7466 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:14,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 7466 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:49:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2025-03-17 13:49:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 1959. [2025-03-17 13:49:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1131 states have (on average 1.8691423519009727) internal successors, (2114), 1952 states have internal predecessors, (2114), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3122 transitions. [2025-03-17 13:49:15,053 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3122 transitions. Word has length 7 [2025-03-17 13:49:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:15,053 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 3122 transitions. [2025-03-17 13:49:15,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3122 transitions. [2025-03-17 13:49:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:49:15,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:15,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:15,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:49:15,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:15,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1928025052, now seen corresponding path program 1 times [2025-03-17 13:49:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082209571] [2025-03-17 13:49:15,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:15,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:49:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:49:15,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:15,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:15,113 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-17 13:49:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082209571] [2025-03-17 13:49:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082209571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007768063] [2025-03-17 13:49:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:15,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:15,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:15,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:15,115 INFO L87 Difference]: Start difference. First operand 1959 states and 3122 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:15,656 INFO L93 Difference]: Finished difference Result 3897 states and 6225 transitions. [2025-03-17 13:49:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 13:49:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:15,667 INFO L225 Difference]: With dead ends: 3897 [2025-03-17 13:49:15,667 INFO L226 Difference]: Without dead ends: 3897 [2025-03-17 13:49:15,668 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-17 13:49:15,668 INFO L435 NwaCegarLoop]: 3104 mSDtfsCounter, 2084 mSDsluCounter, 5631 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 8735 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:15,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 8735 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:49:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2025-03-17 13:49:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 1961. [2025-03-17 13:49:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1133 states have (on average 1.8676081200353045) internal successors, (2116), 1954 states have internal predecessors, (2116), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3124 transitions. [2025-03-17 13:49:15,819 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3124 transitions. Word has length 9 [2025-03-17 13:49:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:15,819 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 3124 transitions. [2025-03-17 13:49:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3124 transitions. [2025-03-17 13:49:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 13:49:15,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:15,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:15,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:49:15,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:15,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1203675537, now seen corresponding path program 1 times [2025-03-17 13:49:15,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:15,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127560066] [2025-03-17 13:49:15,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:15,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 13:49:15,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 13:49:15,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:15,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:15,874 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-17 13:49:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127560066] [2025-03-17 13:49:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127560066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:49:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900569198] [2025-03-17 13:49:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:15,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:15,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:15,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:15,875 INFO L87 Difference]: Start difference. First operand 1961 states and 3124 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:17,404 INFO L93 Difference]: Finished difference Result 1987 states and 3177 transitions. [2025-03-17 13:49:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:17,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 13:49:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:17,416 INFO L225 Difference]: With dead ends: 1987 [2025-03-17 13:49:17,416 INFO L226 Difference]: Without dead ends: 1987 [2025-03-17 13:49:17,416 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-17 13:49:17,417 INFO L435 NwaCegarLoop]: 2669 mSDtfsCounter, 2324 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:17,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2827 Valid, 4221 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 13:49:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-17 13:49:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1938. [2025-03-17 13:49:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1133 states have (on average 1.8473080317740511) internal successors, (2093), 1931 states have internal predecessors, (2093), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3101 transitions. [2025-03-17 13:49:17,524 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3101 transitions. Word has length 16 [2025-03-17 13:49:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 3101 transitions. [2025-03-17 13:49:17,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3101 transitions. [2025-03-17 13:49:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 13:49:17,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:17,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:49:17,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1203675536, now seen corresponding path program 1 times [2025-03-17 13:49:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116034391] [2025-03-17 13:49:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:17,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 13:49:17,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 13:49:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:17,591 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-17 13:49:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:17,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116034391] [2025-03-17 13:49:17,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116034391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:17,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:17,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:49:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980251983] [2025-03-17 13:49:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:17,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:17,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:17,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:17,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:17,593 INFO L87 Difference]: Start difference. First operand 1938 states and 3101 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:17,660 INFO L93 Difference]: Finished difference Result 1863 states and 2998 transitions. [2025-03-17 13:49:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 13:49:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:17,665 INFO L225 Difference]: With dead ends: 1863 [2025-03-17 13:49:17,665 INFO L226 Difference]: Without dead ends: 1863 [2025-03-17 13:49:17,666 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-17 13:49:17,666 INFO L435 NwaCegarLoop]: 2945 mSDtfsCounter, 60 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5837 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:17,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5837 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:49:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-03-17 13:49:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1863. [2025-03-17 13:49:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1070 states have (on average 1.8598130841121496) internal successors, (1990), 1856 states have internal predecessors, (1990), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2998 transitions. [2025-03-17 13:49:17,735 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2998 transitions. Word has length 16 [2025-03-17 13:49:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 1863 states and 2998 transitions. [2025-03-17 13:49:17,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2998 transitions. [2025-03-17 13:49:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:49:17,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:17,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:17,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:49:17,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:17,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1340643180, now seen corresponding path program 1 times [2025-03-17 13:49:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:17,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846539564] [2025-03-17 13:49:17,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:49:17,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:49:17,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:17,775 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-17 13:49:17,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:17,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846539564] [2025-03-17 13:49:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846539564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:17,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:17,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415523298] [2025-03-17 13:49:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:17,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:17,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:17,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:17,777 INFO L87 Difference]: Start difference. First operand 1863 states and 2998 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:17,881 INFO L93 Difference]: Finished difference Result 1845 states and 2973 transitions. [2025-03-17 13:49:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 13:49:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:17,888 INFO L225 Difference]: With dead ends: 1845 [2025-03-17 13:49:17,888 INFO L226 Difference]: Without dead ends: 1845 [2025-03-17 13:49:17,888 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-17 13:49:17,889 INFO L435 NwaCegarLoop]: 2910 mSDtfsCounter, 41 mSDsluCounter, 5792 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8702 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:17,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8702 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:49:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-03-17 13:49:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1842. [2025-03-17 13:49:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1056 states have (on average 1.8579545454545454) internal successors, (1962), 1835 states have internal predecessors, (1962), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2970 transitions. [2025-03-17 13:49:17,956 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2970 transitions. Word has length 17 [2025-03-17 13:49:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:17,956 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2970 transitions. [2025-03-17 13:49:17,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2970 transitions. [2025-03-17 13:49:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 13:49:17,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:17,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:17,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:49:17,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:17,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash -942720158, now seen corresponding path program 1 times [2025-03-17 13:49:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672190326] [2025-03-17 13:49:17,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:17,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 13:49:17,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 13:49:17,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:17,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:18,086 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-17 13:49:18,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:18,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672190326] [2025-03-17 13:49:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672190326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:49:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325643859] [2025-03-17 13:49:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:18,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:18,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:18,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:18,087 INFO L87 Difference]: Start difference. First operand 1842 states and 2970 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:19,662 INFO L93 Difference]: Finished difference Result 3199 states and 5431 transitions. [2025-03-17 13:49:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 13:49:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:19,671 INFO L225 Difference]: With dead ends: 3199 [2025-03-17 13:49:19,671 INFO L226 Difference]: Without dead ends: 3199 [2025-03-17 13:49:19,672 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-17 13:49:19,672 INFO L435 NwaCegarLoop]: 2719 mSDtfsCounter, 1854 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2356 SdHoareTripleChecker+Valid, 6162 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:19,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2356 Valid, 6162 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 13:49:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2025-03-17 13:49:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 1838. [2025-03-17 13:49:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1056 states have (on average 1.8541666666666667) internal successors, (1958), 1831 states have internal predecessors, (1958), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2966 transitions. [2025-03-17 13:49:19,810 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2966 transitions. Word has length 31 [2025-03-17 13:49:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:19,810 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2966 transitions. [2025-03-17 13:49:19,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2966 transitions. [2025-03-17 13:49:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 13:49:19,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:19,813 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] [2025-03-17 13:49:19,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:49:19,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:19,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1559044202, now seen corresponding path program 1 times [2025-03-17 13:49:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:19,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038631809] [2025-03-17 13:49:19,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:19,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 13:49:19,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 13:49:19,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:19,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:19,909 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-17 13:49:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038631809] [2025-03-17 13:49:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038631809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:19,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:19,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017763698] [2025-03-17 13:49:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:19,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:19,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:19,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:19,912 INFO L87 Difference]: Start difference. First operand 1838 states and 2966 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:20,002 INFO L93 Difference]: Finished difference Result 1838 states and 2962 transitions. [2025-03-17 13:49:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:49:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 13:49:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:20,006 INFO L225 Difference]: With dead ends: 1838 [2025-03-17 13:49:20,006 INFO L226 Difference]: Without dead ends: 1838 [2025-03-17 13:49:20,006 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-17 13:49:20,007 INFO L435 NwaCegarLoop]: 2905 mSDtfsCounter, 21 mSDsluCounter, 5779 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8684 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:20,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8684 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:49:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-17 13:49:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-03-17 13:49:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1056 states have (on average 1.8503787878787878) internal successors, (1954), 1831 states have internal predecessors, (1954), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-17 13:49:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2962 transitions. [2025-03-17 13:49:20,076 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2962 transitions. Word has length 65 [2025-03-17 13:49:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2962 transitions. [2025-03-17 13:49:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:49:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2962 transitions. [2025-03-17 13:49:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 13:49:20,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:20,080 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] [2025-03-17 13:49:20,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:49:20,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1071080542, now seen corresponding path program 1 times [2025-03-17 13:49:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:20,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535703569] [2025-03-17 13:49:20,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:20,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 13:49:20,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 13:49:20,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:20,207 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-17 13:49:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535703569] [2025-03-17 13:49:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535703569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:20,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:20,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:20,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277367008] [2025-03-17 13:49:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:20,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:20,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:20,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:20,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:20,211 INFO L87 Difference]: Start difference. First operand 1838 states and 2962 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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-17 13:49:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:20,326 INFO L93 Difference]: Finished difference Result 3162 states and 5380 transitions. [2025-03-17 13:49:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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 73 [2025-03-17 13:49:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:20,333 INFO L225 Difference]: With dead ends: 3162 [2025-03-17 13:49:20,333 INFO L226 Difference]: Without dead ends: 3162 [2025-03-17 13:49:20,333 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-17 13:49:20,333 INFO L435 NwaCegarLoop]: 3191 mSDtfsCounter, 1348 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 6065 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:20,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 6065 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:49:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2025-03-17 13:49:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3108. [2025-03-17 13:49:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 1826 states have (on average 1.8450164293537787) internal successors, (3369), 3101 states have internal predecessors, (3369), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-17 13:49:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 5377 transitions. [2025-03-17 13:49:20,498 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 5377 transitions. Word has length 73 [2025-03-17 13:49:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:20,499 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 5377 transitions. [2025-03-17 13:49:20,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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-17 13:49:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 5377 transitions. [2025-03-17 13:49:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 13:49:20,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:20,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:49:20,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:20,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 154219114, now seen corresponding path program 1 times [2025-03-17 13:49:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:20,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287696222] [2025-03-17 13:49:20,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:20,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 13:49:20,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 13:49:20,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:20,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:20,733 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-17 13:49:20,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287696222] [2025-03-17 13:49:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287696222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737908217] [2025-03-17 13:49:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:49:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:20,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:49:20,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:49:20,735 INFO L87 Difference]: Start difference. First operand 3108 states and 5377 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-17 13:49:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:21,297 INFO L93 Difference]: Finished difference Result 3107 states and 5376 transitions. [2025-03-17 13:49:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:49:21,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2025-03-17 13:49:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:21,304 INFO L225 Difference]: With dead ends: 3107 [2025-03-17 13:49:21,304 INFO L226 Difference]: Without dead ends: 3107 [2025-03-17 13:49:21,304 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-17 13:49:21,304 INFO L435 NwaCegarLoop]: 2915 mSDtfsCounter, 2 mSDsluCounter, 7757 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10672 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:21,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10672 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:49:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-03-17 13:49:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3107. [2025-03-17 13:49:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 1826 states have (on average 1.8444687842278205) internal successors, (3368), 3100 states have internal predecessors, (3368), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-17 13:49:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 5376 transitions. [2025-03-17 13:49:21,459 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 5376 transitions. Word has length 81 [2025-03-17 13:49:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:21,460 INFO L471 AbstractCegarLoop]: Abstraction has 3107 states and 5376 transitions. [2025-03-17 13:49:21,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-17 13:49:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 5376 transitions. [2025-03-17 13:49:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 13:49:21,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:21,461 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] [2025-03-17 13:49:21,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:49:21,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:21,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 154219115, now seen corresponding path program 1 times [2025-03-17 13:49:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:21,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261397312] [2025-03-17 13:49:21,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:21,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 13:49:21,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 13:49:21,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:21,834 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-17 13:49:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261397312] [2025-03-17 13:49:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261397312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:21,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482387701] [2025-03-17 13:49:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:21,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:49:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:21,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:49:21,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:49:21,836 INFO L87 Difference]: Start difference. First operand 3107 states and 5376 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-17 13:49:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:22,440 INFO L93 Difference]: Finished difference Result 3106 states and 5375 transitions. [2025-03-17 13:49:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:49:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2025-03-17 13:49:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:22,447 INFO L225 Difference]: With dead ends: 3106 [2025-03-17 13:49:22,447 INFO L226 Difference]: Without dead ends: 3106 [2025-03-17 13:49:22,447 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-17 13:49:22,448 INFO L435 NwaCegarLoop]: 2915 mSDtfsCounter, 1 mSDsluCounter, 7728 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10643 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:22,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10643 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:49:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-17 13:49:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2025-03-17 13:49:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 1825 states have (on average 1.844931506849315) internal successors, (3367), 3099 states have internal predecessors, (3367), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-17 13:49:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5375 transitions. [2025-03-17 13:49:22,601 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5375 transitions. Word has length 81 [2025-03-17 13:49:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:22,601 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5375 transitions. [2025-03-17 13:49:22,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-17 13:49:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5375 transitions. [2025-03-17 13:49:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:49:22,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:22,602 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-17 13:49:22,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:49:22,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:22,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -808046713, now seen corresponding path program 1 times [2025-03-17 13:49:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:22,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875356133] [2025-03-17 13:49:22,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:22,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:49:22,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:49:22,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:22,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:22,776 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-17 13:49:22,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875356133] [2025-03-17 13:49:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875356133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:49:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509709461] [2025-03-17 13:49:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:22,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:49:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:22,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:49:22,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:49:22,778 INFO L87 Difference]: Start difference. First operand 3106 states and 5375 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 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-17 13:49:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:25,823 INFO L93 Difference]: Finished difference Result 3118 states and 5390 transitions. [2025-03-17 13:49:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:49:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 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-17 13:49:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:25,835 INFO L225 Difference]: With dead ends: 3118 [2025-03-17 13:49:25,836 INFO L226 Difference]: Without dead ends: 3118 [2025-03-17 13:49:25,837 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-17 13:49:25,837 INFO L435 NwaCegarLoop]: 2900 mSDtfsCounter, 13 mSDsluCounter, 9777 mSDsCounter, 0 mSdLazyCounter, 4507 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12677 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:25,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12677 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 4507 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 13:49:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2025-03-17 13:49:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 3112. [2025-03-17 13:49:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 1830 states have (on average 1.8437158469945356) internal successors, (3374), 3104 states have internal predecessors, (3374), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1006), 6 states have call predecessors, (1006), 1003 states have call successors, (1006) [2025-03-17 13:49:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 5385 transitions. [2025-03-17 13:49:26,006 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 5385 transitions. Word has length 89 [2025-03-17 13:49:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:26,006 INFO L471 AbstractCegarLoop]: Abstraction has 3112 states and 5385 transitions. [2025-03-17 13:49:26,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 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-17 13:49:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 5385 transitions. [2025-03-17 13:49:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:49:26,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:26,008 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-17 13:49:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:49:26,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -808046712, now seen corresponding path program 1 times [2025-03-17 13:49:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190412739] [2025-03-17 13:49:26,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:26,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:49:26,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:49:26,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:26,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:26,402 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-17 13:49:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190412739] [2025-03-17 13:49:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190412739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:49:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963155823] [2025-03-17 13:49:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:49:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:49:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:49:26,403 INFO L87 Difference]: Start difference. First operand 3112 states and 5385 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 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-17 13:49:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:28,981 INFO L93 Difference]: Finished difference Result 3112 states and 5384 transitions. [2025-03-17 13:49:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:49:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 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-17 13:49:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:28,988 INFO L225 Difference]: With dead ends: 3112 [2025-03-17 13:49:28,988 INFO L226 Difference]: Without dead ends: 3112 [2025-03-17 13:49:28,988 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-17 13:49:28,988 INFO L435 NwaCegarLoop]: 2904 mSDtfsCounter, 8 mSDsluCounter, 7994 mSDsCounter, 0 mSdLazyCounter, 3333 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10898 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:28,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10898 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3333 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 13:49:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2025-03-17 13:49:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2025-03-17 13:49:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 1830 states have (on average 1.8431693989071039) internal successors, (3373), 3104 states have internal predecessors, (3373), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1006), 6 states have call predecessors, (1006), 1003 states have call successors, (1006) [2025-03-17 13:49:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 5384 transitions. [2025-03-17 13:49:29,167 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 5384 transitions. Word has length 89 [2025-03-17 13:49:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:29,168 INFO L471 AbstractCegarLoop]: Abstraction has 3112 states and 5384 transitions. [2025-03-17 13:49:29,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 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-17 13:49:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 5384 transitions. [2025-03-17 13:49:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 13:49:29,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:29,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:49:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:49:29,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:29,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash -833388256, now seen corresponding path program 1 times [2025-03-17 13:49:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214519622] [2025-03-17 13:49:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:29,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:29,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:29,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:29,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:29,519 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-17 13:49:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214519622] [2025-03-17 13:49:29,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214519622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384033317] [2025-03-17 13:49:29,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:29,522 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-17 13:49:29,524 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-17 13:49:29,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:29,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 13:49:29,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:29,792 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:49:29,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:49:29,825 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-17 13:49:29,896 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-17 13:49:30,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:30,051 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-17 13:49:30,078 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-17 13:49:30,101 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-17 13:49:30,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:30,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:49:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384033317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:30,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:30,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-17 13:49:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874408333] [2025-03-17 13:49:30,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:30,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:49:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:30,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:49:30,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-03-17 13:49:30,129 INFO L87 Difference]: Start difference. First operand 3112 states and 5384 transitions. Second operand has 19 states, 16 states have (on average 7.1875) internal successors, (115), 18 states have internal predecessors, (115), 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-17 13:49:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:37,246 INFO L93 Difference]: Finished difference Result 3119 states and 5391 transitions. [2025-03-17 13:49:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:49:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.1875) internal successors, (115), 18 states have internal predecessors, (115), 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-17 13:49:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:37,252 INFO L225 Difference]: With dead ends: 3119 [2025-03-17 13:49:37,252 INFO L226 Difference]: Without dead ends: 3119 [2025-03-17 13:49:37,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-03-17 13:49:37,252 INFO L435 NwaCegarLoop]: 2567 mSDtfsCounter, 1866 mSDsluCounter, 17045 mSDsCounter, 0 mSdLazyCounter, 12824 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 19612 SdHoareTripleChecker+Invalid, 13341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:37,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 19612 Invalid, 13341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 12824 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-17 13:49:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2025-03-17 13:49:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3116. [2025-03-17 13:49:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 1834 states have (on average 1.841330425299891) internal successors, (3377), 3107 states have internal predecessors, (3377), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 6 states have call predecessors, (1004), 1003 states have call successors, (1004) [2025-03-17 13:49:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 5386 transitions. [2025-03-17 13:49:37,440 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 5386 transitions. Word has length 90 [2025-03-17 13:49:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:37,440 INFO L471 AbstractCegarLoop]: Abstraction has 3116 states and 5386 transitions. [2025-03-17 13:49:37,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.1875) internal successors, (115), 18 states have internal predecessors, (115), 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-17 13:49:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 5386 transitions. [2025-03-17 13:49:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 13:49:37,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:37,441 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-17 13:49:37,449 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-17 13:49:37,642 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,SelfDestructingSolverStorable16 [2025-03-17 13:49:37,643 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:37,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash -833388255, now seen corresponding path program 1 times [2025-03-17 13:49:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363108942] [2025-03-17 13:49:37,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:37,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:37,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:38,166 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-17 13:49:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363108942] [2025-03-17 13:49:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363108942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566411680] [2025-03-17 13:49:38,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:38,170 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-17 13:49:38,171 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-17 13:49:38,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:38,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 13:49:38,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:38,387 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-17 13:49:38,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:38,393 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-17 13:49:38,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 13:49:38,419 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-17 13:49:38,487 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-17 13:49:38,492 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-17 13:49:38,574 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:38,575 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-17 13:49:38,579 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-17 13:49:38,612 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-17 13:49:38,618 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-17 13:49:38,632 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-17 13:49:38,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566411680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:38,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:38,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-03-17 13:49:38,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767725233] [2025-03-17 13:49:38,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:38,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:49:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:38,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:49:38,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=346, Unknown=13, NotChecked=0, Total=420 [2025-03-17 13:49:38,747 INFO L87 Difference]: Start difference. First operand 3116 states and 5386 transitions. Second operand has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 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-17 13:49:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:45,551 INFO L93 Difference]: Finished difference Result 3118 states and 5390 transitions. [2025-03-17 13:49:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:49:45,552 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 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-17 13:49:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:45,557 INFO L225 Difference]: With dead ends: 3118 [2025-03-17 13:49:45,557 INFO L226 Difference]: Without dead ends: 3118 [2025-03-17 13:49:45,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=491, Unknown=14, NotChecked=0, Total=600 [2025-03-17 13:49:45,557 INFO L435 NwaCegarLoop]: 2570 mSDtfsCounter, 1867 mSDsluCounter, 18203 mSDsCounter, 0 mSdLazyCounter, 11142 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 20773 SdHoareTripleChecker+Invalid, 11661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 11142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:45,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 20773 Invalid, 11661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 11142 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-17 13:49:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2025-03-17 13:49:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 3109. [2025-03-17 13:49:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 1829 states have (on average 1.8425369054127938) internal successors, (3370), 3101 states have internal predecessors, (3370), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 3 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-17 13:49:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 5378 transitions. [2025-03-17 13:49:45,738 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 5378 transitions. Word has length 90 [2025-03-17 13:49:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:45,738 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 5378 transitions. [2025-03-17 13:49:45,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 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-17 13:49:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 5378 transitions. [2025-03-17 13:49:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:49:45,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:45,739 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-17 13:49:45,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 13:49:45,940 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,SelfDestructingSolverStorable17 [2025-03-17 13:49:45,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:45,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash 775912887, now seen corresponding path program 1 times [2025-03-17 13:49:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980218046] [2025-03-17 13:49:45,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:45,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:45,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:45,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:45,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:46,282 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-17 13:49:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980218046] [2025-03-17 13:49:46,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980218046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:46,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:46,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:49:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195144719] [2025-03-17 13:49:46,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:46,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:49:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:46,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:49:46,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:49:46,284 INFO L87 Difference]: Start difference. First operand 3109 states and 5378 transitions. Second operand has 14 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-17 13:49:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:49,973 INFO L93 Difference]: Finished difference Result 3122 states and 5394 transitions. [2025-03-17 13:49:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:49:49,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 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-17 13:49:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:49,979 INFO L225 Difference]: With dead ends: 3122 [2025-03-17 13:49:49,979 INFO L226 Difference]: Without dead ends: 3122 [2025-03-17 13:49:49,979 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-17 13:49:49,980 INFO L435 NwaCegarLoop]: 2567 mSDtfsCounter, 1874 mSDsluCounter, 12361 mSDsCounter, 0 mSdLazyCounter, 9168 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 14928 SdHoareTripleChecker+Invalid, 9682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 9168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:49,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2378 Valid, 14928 Invalid, 9682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 9168 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 13:49:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2025-03-17 13:49:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3118. [2025-03-17 13:49:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 1837 states have (on average 1.8399564507348938) internal successors, (3380), 3109 states have internal predecessors, (3380), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 6 states have call predecessors, (1004), 1003 states have call successors, (1004) [2025-03-17 13:49:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 5389 transitions. [2025-03-17 13:49:50,153 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 5389 transitions. Word has length 92 [2025-03-17 13:49:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:50,153 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 5389 transitions. [2025-03-17 13:49:50,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 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-17 13:49:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 5389 transitions. [2025-03-17 13:49:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:49:50,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:50,154 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-17 13:49:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:49:50,154 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash 775912888, now seen corresponding path program 1 times [2025-03-17 13:49:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185346582] [2025-03-17 13:49:50,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:50,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:50,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:50,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:50,596 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-17 13:49:50,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:50,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185346582] [2025-03-17 13:49:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185346582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:49:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12953075] [2025-03-17 13:49:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:49:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:50,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:49:50,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:49:50,598 INFO L87 Difference]: Start difference. First operand 3118 states and 5389 transitions. Second operand has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 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-17 13:49:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:54,322 INFO L93 Difference]: Finished difference Result 3121 states and 5393 transitions. [2025-03-17 13:49:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:49:54,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 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-17 13:49:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:54,327 INFO L225 Difference]: With dead ends: 3121 [2025-03-17 13:49:54,327 INFO L226 Difference]: Without dead ends: 3121 [2025-03-17 13:49:54,327 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-17 13:49:54,328 INFO L435 NwaCegarLoop]: 2571 mSDtfsCounter, 1866 mSDsluCounter, 11347 mSDsCounter, 0 mSdLazyCounter, 6735 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 13918 SdHoareTripleChecker+Invalid, 7247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 6735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:54,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 13918 Invalid, 7247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 6735 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 13:49:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2025-03-17 13:49:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3118. [2025-03-17 13:49:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 1837 states have (on average 1.839412084921067) internal successors, (3379), 3109 states have internal predecessors, (3379), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 6 states have call predecessors, (1004), 1003 states have call successors, (1004) [2025-03-17 13:49:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 5388 transitions. [2025-03-17 13:49:54,486 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 5388 transitions. Word has length 92 [2025-03-17 13:49:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:54,487 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 5388 transitions. [2025-03-17 13:49:54,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 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-17 13:49:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 5388 transitions. [2025-03-17 13:49:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 13:49:54,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:54,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:49:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:49:54,487 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:49:54,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1740249470, now seen corresponding path program 1 times [2025-03-17 13:49:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5387922] [2025-03-17 13:49:54,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:49:54,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:49:54,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:54,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:54,842 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-17 13:49:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5387922] [2025-03-17 13:49:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5387922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742379540] [2025-03-17 13:49:54,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:54,845 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-17 13:49:54,846 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-17 13:49:54,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:49:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:49:55,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:55,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:49:55,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:55,023 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-17 13:49:55,110 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:49:55,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:49:55,133 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-17 13:49:55,188 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-17 13:49:55,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:55,294 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-17 13:49:55,354 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:55,355 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-17 13:49:55,366 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-17 13:49:55,385 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-17 13:49:55,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:55,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1022 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1022))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742379540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:55,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-17 13:49:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075389238] [2025-03-17 13:49:55,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:55,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:49:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:55,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:49:55,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=459, Unknown=15, NotChecked=44, Total=600 [2025-03-17 13:49:55,457 INFO L87 Difference]: Start difference. First operand 3118 states and 5388 transitions. Second operand has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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-17 13:50:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:50:04,859 INFO L93 Difference]: Finished difference Result 3120 states and 5392 transitions. [2025-03-17 13:50:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:50:04,859 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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 93 [2025-03-17 13:50:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:50:04,863 INFO L225 Difference]: With dead ends: 3120 [2025-03-17 13:50:04,863 INFO L226 Difference]: Without dead ends: 3120 [2025-03-17 13:50:04,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=585, Unknown=17, NotChecked=50, Total=756 [2025-03-17 13:50:04,864 INFO L435 NwaCegarLoop]: 2566 mSDtfsCounter, 1844 mSDsluCounter, 21676 mSDsCounter, 0 mSdLazyCounter, 16979 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 24242 SdHoareTripleChecker+Invalid, 17492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 16979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:50:04,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 24242 Invalid, 17492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 16979 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-03-17 13:50:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2025-03-17 13:50:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3117. [2025-03-17 13:50:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 1837 states have (on average 1.83886771910724) internal successors, (3378), 3108 states have internal predecessors, (3378), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 6 states have call predecessors, (1004), 1003 states have call successors, (1004) [2025-03-17 13:50:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 5387 transitions. [2025-03-17 13:50:05,015 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 5387 transitions. Word has length 93 [2025-03-17 13:50:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:50:05,015 INFO L471 AbstractCegarLoop]: Abstraction has 3117 states and 5387 transitions. [2025-03-17 13:50:05,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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-17 13:50:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 5387 transitions. [2025-03-17 13:50:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 13:50:05,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:50:05,016 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-17 13:50:05,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:50:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:50:05,217 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:50:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:50:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1740249471, now seen corresponding path program 1 times [2025-03-17 13:50:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:50:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494397354] [2025-03-17 13:50:05,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:50:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:50:05,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:50:05,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:50:05,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:50:05,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:50:05,711 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-17 13:50:05,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:50:05,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494397354] [2025-03-17 13:50:05,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494397354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:50:05,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444686067] [2025-03-17 13:50:05,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:50:05,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:50:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:50:05,714 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-17 13:50:05,716 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-17 13:50:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:50:05,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:50:05,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:50:05,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:50:05,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:50:05,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:50:05,898 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-17 13:50:05,975 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-17 13:50:05,981 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:50:05,982 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-17 13:50:06,003 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-17 13:50:06,007 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-17 13:50:06,064 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-17 13:50:06,068 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-17 13:50:06,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:50:06,140 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-17 13:50:06,144 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-17 13:50:06,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:50:06,203 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-17 13:50:06,208 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-17 13:50:06,219 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-17 13:50:06,222 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-17 13:50:06,234 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-17 13:50:06,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:50:06,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:50:06,288 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_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-03-17 13:50:06,325 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1180) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1179))) (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~mem54#1.base| v_ArrVal_1180) .cse1 v_ArrVal_1173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:50:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444686067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:50:06,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:50:06,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-17 13:50:06,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716697537] [2025-03-17 13:50:06,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:50:06,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:50:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:50:06,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:50:06,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-03-17 13:50:06,327 INFO L87 Difference]: Start difference. First operand 3117 states and 5387 transitions. Second operand has 20 states, 17 states have (on average 8.705882352941176) internal successors, (148), 20 states have internal predecessors, (148), 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-17 13:50:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:50:15,915 INFO L93 Difference]: Finished difference Result 3119 states and 5391 transitions. [2025-03-17 13:50:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:50:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.705882352941176) internal successors, (148), 20 states have internal predecessors, (148), 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 93 [2025-03-17 13:50:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:50:15,923 INFO L225 Difference]: With dead ends: 3119 [2025-03-17 13:50:15,923 INFO L226 Difference]: Without dead ends: 3119 [2025-03-17 13:50:15,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-03-17 13:50:15,924 INFO L435 NwaCegarLoop]: 2569 mSDtfsCounter, 1859 mSDsluCounter, 18584 mSDsCounter, 0 mSdLazyCounter, 11786 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2363 SdHoareTripleChecker+Valid, 21153 SdHoareTripleChecker+Invalid, 12808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 11786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:50:15,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2363 Valid, 21153 Invalid, 12808 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 11786 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2025-03-17 13:50:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2025-03-17 13:50:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3107. [2025-03-17 13:50:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 1829 states have (on average 1.8414434117003826) internal successors, (3368), 3099 states have internal predecessors, (3368), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 3 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-17 13:50:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 5376 transitions. [2025-03-17 13:50:16,074 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 5376 transitions. Word has length 93 [2025-03-17 13:50:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:50:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 3107 states and 5376 transitions. [2025-03-17 13:50:16,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.705882352941176) internal successors, (148), 20 states have internal predecessors, (148), 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-17 13:50:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 5376 transitions. [2025-03-17 13:50:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:50:16,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:50:16,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:50:16,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 13:50:16,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:50:16,276 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:50:16,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:50:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash -289331616, now seen corresponding path program 1 times [2025-03-17 13:50:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:50:16,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48692131] [2025-03-17 13:50:16,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:50:16,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:50:16,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:50:16,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:50:16,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:50:16,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:50:16,585 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-17 13:50:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:50:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48692131] [2025-03-17 13:50:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48692131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:50:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:50:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:50:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72184599] [2025-03-17 13:50:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:50:16,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:50:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:50:16,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:50:16,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:50:16,586 INFO L87 Difference]: Start difference. First operand 3107 states and 5376 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 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-17 13:50:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:50:20,164 INFO L93 Difference]: Finished difference Result 3123 states and 5395 transitions. [2025-03-17 13:50:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:50:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 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 95 [2025-03-17 13:50:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:50:20,170 INFO L225 Difference]: With dead ends: 3123 [2025-03-17 13:50:20,170 INFO L226 Difference]: Without dead ends: 3123 [2025-03-17 13:50:20,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:50:20,170 INFO L435 NwaCegarLoop]: 2569 mSDtfsCounter, 1870 mSDsluCounter, 12893 mSDsCounter, 0 mSdLazyCounter, 8134 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 15462 SdHoareTripleChecker+Invalid, 8646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 8134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:50:20,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 15462 Invalid, 8646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 8134 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 13:50:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2025-03-17 13:50:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3119. [2025-03-17 13:50:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 1840 states have (on average 1.8375) internal successors, (3381), 3110 states have internal predecessors, (3381), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 6 states have call predecessors, (1004), 1003 states have call successors, (1004) [2025-03-17 13:50:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 5390 transitions. [2025-03-17 13:50:20,320 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 5390 transitions. Word has length 95 [2025-03-17 13:50:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:50:20,321 INFO L471 AbstractCegarLoop]: Abstraction has 3119 states and 5390 transitions. [2025-03-17 13:50:20,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 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-17 13:50:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 5390 transitions. [2025-03-17 13:50:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:50:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:50:20,321 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] [2025-03-17 13:50:20,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 13:50:20,321 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:50:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:50:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash -289331615, now seen corresponding path program 1 times [2025-03-17 13:50:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:50:20,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058824232] [2025-03-17 13:50:20,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:50:20,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:50:20,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:50:20,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:50:20,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:50:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:50:20,809 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-17 13:50:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:50:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058824232] [2025-03-17 13:50:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058824232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:50:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:50:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:50:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114081718] [2025-03-17 13:50:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:50:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:50:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:50:20,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:50:20,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:50:20,810 INFO L87 Difference]: Start difference. First operand 3119 states and 5390 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 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)