./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_FNV_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:29:33,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:29:33,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:29:33,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:29:33,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:29:33,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:29:33,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:29:33,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:29:33,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:29:33,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:29:33,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:29:33,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:29:33,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:29:33,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:29:33,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:29:33,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:29:33,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:29:33,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:29:33,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:29:33,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:29:33,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:29:33,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:29:33,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:29:33,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:29:33,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:29:33,853 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-memcleanup) ) 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 -> 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 [2025-03-17 11:29:34,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:29:34,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:29:34,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:29:34,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:29:34,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:29:34,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-17 11:29:35,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ba4d998/60561fb03e3340efa0988ae9a57bde6a/FLAG9ccc46f62 [2025-03-17 11:29:35,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:29:35,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-17 11:29:35,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ba4d998/60561fb03e3340efa0988ae9a57bde6a/FLAG9ccc46f62 [2025-03-17 11:29:35,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ba4d998/60561fb03e3340efa0988ae9a57bde6a [2025-03-17 11:29:35,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:29:35,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:29:35,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:29:35,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:29:35,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:29:35,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:29:35" (1/1) ... [2025-03-17 11:29:35,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b3c58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:35, skipping insertion in model container [2025-03-17 11:29:35,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:29:35" (1/1) ... [2025-03-17 11:29:35,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:29:36,146 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 11:29:36,164 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 11:29:36,169 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 11:29:36,172 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 11:29:36,176 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 11:29:36,199 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 11:29:36,200 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 11:29:36,201 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 11:29:36,202 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 11:29:36,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:29:36,219 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:29:36,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:29:36,359 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:29:36,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36 WrapperNode [2025-03-17 11:29:36,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:29:36,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:29:36,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:29:36,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:29:36,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,487 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-03-17 11:29:36,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:29:36,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:29:36,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:29:36,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:29:36,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,570 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 11:29:36,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:29:36,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:29:36,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:29:36,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:29:36,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (1/1) ... [2025-03-17 11:29:36,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:29:36,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:29:36,695 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 11:29:36,697 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 11:29:36,714 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 11:29:36,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 11:29:36,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 11:29:36,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 11:29:36,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 11:29:36,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:29:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:29:36,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:29:36,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:29:36,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:29:36,852 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:29:36,853 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:29:39,017 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 11:29:39,187 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2025-03-17 11:29:39,187 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:29:39,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:29:39,252 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 11:29:39,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:29:39 BoogieIcfgContainer [2025-03-17 11:29:39,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:29:39,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:29:39,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:29:39,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:29:39,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:29:35" (1/3) ... [2025-03-17 11:29:39,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8ff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:29:39, skipping insertion in model container [2025-03-17 11:29:39,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:29:36" (2/3) ... [2025-03-17 11:29:39,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8ff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:29:39, skipping insertion in model container [2025-03-17 11:29:39,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:29:39" (3/3) ... [2025-03-17 11:29:39,261 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-1.i [2025-03-17 11:29:39,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:29:39,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-1.i that has 6 procedures, 1376 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-17 11:29:39,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:29:39,332 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;@2652cc74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:29:39,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:29:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 1368 states, 857 states have (on average 1.8413068844807468) internal successors, (1578), 1361 states have internal predecessors, (1578), 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 11:29:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:29:39,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:39,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:29:39,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:39,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash 860310492, now seen corresponding path program 1 times [2025-03-17 11:29:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811199686] [2025-03-17 11:29:39,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:39,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:29:39,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:29:39,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:39,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:39,461 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 11:29:39,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811199686] [2025-03-17 11:29:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811199686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:39,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:29:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701360921] [2025-03-17 11:29:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:39,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:29:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:39,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:29:39,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:29:39,496 INFO L87 Difference]: Start difference. First operand has 1368 states, 857 states have (on average 1.8413068844807468) internal successors, (1578), 1361 states have internal predecessors, (1578), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 11:29:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:39,661 INFO L93 Difference]: Finished difference Result 1366 states and 2529 transitions. [2025-03-17 11:29:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:29:39,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 11:29:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:39,686 INFO L225 Difference]: With dead ends: 1366 [2025-03-17 11:29:39,686 INFO L226 Difference]: Without dead ends: 1364 [2025-03-17 11:29:39,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:29:39,689 INFO L435 NwaCegarLoop]: 2488 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:39,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2488 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:29:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-17 11:29:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2025-03-17 11:29:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 855 states have (on average 1.776608187134503) internal successors, (1519), 1357 states have internal predecessors, (1519), 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 11:29:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2527 transitions. [2025-03-17 11:29:39,995 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2527 transitions. Word has length 6 [2025-03-17 11:29:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:39,995 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2527 transitions. [2025-03-17 11:29:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 11:29:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2527 transitions. [2025-03-17 11:29:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:29:39,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:39,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:29:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:29:39,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2041380305, now seen corresponding path program 1 times [2025-03-17 11:29:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889358245] [2025-03-17 11:29:39,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:40,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:29:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:29:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:29:40,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:40,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889358245] [2025-03-17 11:29:40,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889358245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:40,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:40,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:29:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027028447] [2025-03-17 11:29:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:40,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:29:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:40,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:29:40,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:29:40,159 INFO L87 Difference]: Start difference. First operand 1364 states and 2527 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:29:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:40,864 INFO L93 Difference]: Finished difference Result 2712 states and 5039 transitions. [2025-03-17 11:29:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:29:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-17 11:29:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:40,881 INFO L225 Difference]: With dead ends: 2712 [2025-03-17 11:29:40,882 INFO L226 Difference]: Without dead ends: 2712 [2025-03-17 11:29:40,883 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 11:29:40,883 INFO L435 NwaCegarLoop]: 2568 mSDtfsCounter, 1502 mSDsluCounter, 4527 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 7095 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:40,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 7095 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:29:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-03-17 11:29:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1366. [2025-03-17 11:29:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 857 states have (on average 1.7747957992998833) internal successors, (1521), 1359 states have internal predecessors, (1521), 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 11:29:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2529 transitions. [2025-03-17 11:29:41,093 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2529 transitions. Word has length 8 [2025-03-17 11:29:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:41,093 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2529 transitions. [2025-03-17 11:29:41,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:29:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2529 transitions. [2025-03-17 11:29:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 11:29:41,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:41,095 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:41,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:29:41,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:41,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash -870415799, now seen corresponding path program 1 times [2025-03-17 11:29:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50430249] [2025-03-17 11:29:41,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:41,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:29:41,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:29:41,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:41,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:29:41,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50430249] [2025-03-17 11:29:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50430249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:29:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995618587] [2025-03-17 11:29:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:41,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:29:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:41,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:29:41,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:29:41,420 INFO L87 Difference]: Start difference. First operand 1366 states and 2529 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 11:29:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:41,562 INFO L93 Difference]: Finished difference Result 1324 states and 2452 transitions. [2025-03-17 11:29:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:29:41,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2025-03-17 11:29:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:41,569 INFO L225 Difference]: With dead ends: 1324 [2025-03-17 11:29:41,569 INFO L226 Difference]: Without dead ends: 1324 [2025-03-17 11:29:41,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:29:41,570 INFO L435 NwaCegarLoop]: 2394 mSDtfsCounter, 30 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:41,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:29:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-03-17 11:29:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2025-03-17 11:29:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 815 states have (on average 1.7717791411042945) internal successors, (1444), 1317 states have internal predecessors, (1444), 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 11:29:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2452 transitions. [2025-03-17 11:29:41,676 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2452 transitions. Word has length 82 [2025-03-17 11:29:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:41,676 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2452 transitions. [2025-03-17 11:29:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 11:29:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2452 transitions. [2025-03-17 11:29:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 11:29:41,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:41,678 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:41,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:29:41,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2112411581, now seen corresponding path program 1 times [2025-03-17 11:29:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286124648] [2025-03-17 11:29:41,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:41,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:29:41,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:29:41,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:41,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:29:41,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:41,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286124648] [2025-03-17 11:29:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286124648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:29:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167767962] [2025-03-17 11:29:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:41,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:29:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:41,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:29:41,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:29:41,834 INFO L87 Difference]: Start difference. First operand 1324 states and 2452 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 11:29:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:41,980 INFO L93 Difference]: Finished difference Result 2546 states and 4772 transitions. [2025-03-17 11:29:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:29:41,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 82 [2025-03-17 11:29:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:41,991 INFO L225 Difference]: With dead ends: 2546 [2025-03-17 11:29:41,991 INFO L226 Difference]: Without dead ends: 2546 [2025-03-17 11:29:41,992 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 11:29:41,992 INFO L435 NwaCegarLoop]: 2598 mSDtfsCounter, 1260 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:41,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 4996 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:29:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2025-03-17 11:29:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2542. [2025-03-17 11:29:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1533 states have (on average 1.8010437051532941) internal successors, (2761), 2535 states have internal predecessors, (2761), 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 11:29:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4769 transitions. [2025-03-17 11:29:42,165 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4769 transitions. Word has length 82 [2025-03-17 11:29:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:42,165 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 4769 transitions. [2025-03-17 11:29:42,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 11:29:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4769 transitions. [2025-03-17 11:29:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 11:29:42,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:42,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:42,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:29:42,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2044353165, now seen corresponding path program 1 times [2025-03-17 11:29:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197487992] [2025-03-17 11:29:42,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:42,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:29:42,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:29:42,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:29:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197487992] [2025-03-17 11:29:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197487992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:29:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050420057] [2025-03-17 11:29:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:29:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:42,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:29:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:29:42,535 INFO L87 Difference]: Start difference. First operand 2542 states and 4769 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:43,146 INFO L93 Difference]: Finished difference Result 4764 states and 9088 transitions. [2025-03-17 11:29:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:29:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-03-17 11:29:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:43,173 INFO L225 Difference]: With dead ends: 4764 [2025-03-17 11:29:43,174 INFO L226 Difference]: Without dead ends: 4764 [2025-03-17 11:29:43,174 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 11:29:43,175 INFO L435 NwaCegarLoop]: 2473 mSDtfsCounter, 1415 mSDsluCounter, 4358 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 6831 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:43,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 6831 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:29:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2025-03-17 11:29:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 2544. [2025-03-17 11:29:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1535 states have (on average 1.8) internal successors, (2763), 2537 states have internal predecessors, (2763), 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 11:29:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 4771 transitions. [2025-03-17 11:29:43,514 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 4771 transitions. Word has length 97 [2025-03-17 11:29:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:43,515 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 4771 transitions. [2025-03-17 11:29:43,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 4771 transitions. [2025-03-17 11:29:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 11:29:43,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:43,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:43,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:29:43,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1663038473, now seen corresponding path program 1 times [2025-03-17 11:29:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:43,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490336935] [2025-03-17 11:29:43,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:43,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:29:43,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:29:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:29:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490336935] [2025-03-17 11:29:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490336935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:29:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724377483] [2025-03-17 11:29:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:43,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:29:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:43,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:29:43,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:29:43,707 INFO L87 Difference]: Start difference. First operand 2544 states and 4771 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:43,812 INFO L93 Difference]: Finished difference Result 2584 states and 4811 transitions. [2025-03-17 11:29:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:29:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-03-17 11:29:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:43,824 INFO L225 Difference]: With dead ends: 2584 [2025-03-17 11:29:43,824 INFO L226 Difference]: Without dead ends: 2584 [2025-03-17 11:29:43,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:29:43,826 INFO L435 NwaCegarLoop]: 2392 mSDtfsCounter, 8 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:43,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4769 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:29:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2025-03-17 11:29:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2584. [2025-03-17 11:29:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 1575 states have (on average 1.7796825396825398) internal successors, (2803), 2577 states have internal predecessors, (2803), 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 11:29:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4811 transitions. [2025-03-17 11:29:44,035 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4811 transitions. Word has length 152 [2025-03-17 11:29:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:44,036 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 4811 transitions. [2025-03-17 11:29:44,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4811 transitions. [2025-03-17 11:29:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 11:29:44,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:44,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:44,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:29:44,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:44,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 681628568, now seen corresponding path program 1 times [2025-03-17 11:29:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:44,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121671169] [2025-03-17 11:29:44,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:44,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:29:44,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:29:44,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:44,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:29:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:44,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121671169] [2025-03-17 11:29:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121671169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:44,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:44,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:29:44,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392926377] [2025-03-17 11:29:44,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:44,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:29:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:44,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:29:44,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:29:44,271 INFO L87 Difference]: Start difference. First operand 2584 states and 4811 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:44,382 INFO L93 Difference]: Finished difference Result 2460 states and 4611 transitions. [2025-03-17 11:29:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:29:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-03-17 11:29:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:44,393 INFO L225 Difference]: With dead ends: 2460 [2025-03-17 11:29:44,393 INFO L226 Difference]: Without dead ends: 2460 [2025-03-17 11:29:44,393 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 11:29:44,394 INFO L435 NwaCegarLoop]: 2317 mSDtfsCounter, 32 mSDsluCounter, 4620 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6937 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:44,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6937 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:29:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-03-17 11:29:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2460. [2025-03-17 11:29:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 1451 states have (on average 1.793935217091661) internal successors, (2603), 2453 states have internal predecessors, (2603), 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 11:29:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 4611 transitions. [2025-03-17 11:29:44,604 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 4611 transitions. Word has length 152 [2025-03-17 11:29:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:44,605 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 4611 transitions. [2025-03-17 11:29:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 4611 transitions. [2025-03-17 11:29:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 11:29:44,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:44,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:44,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:29:44,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:44,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash 533881009, now seen corresponding path program 1 times [2025-03-17 11:29:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009285907] [2025-03-17 11:29:44,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:44,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:29:44,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:29:44,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:44,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009285907] [2025-03-17 11:29:44,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009285907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:29:44,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:29:44,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:29:44,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136016157] [2025-03-17 11:29:44,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:29:44,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:29:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:44,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:29:44,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:29:44,849 INFO L87 Difference]: Start difference. First operand 2460 states and 4611 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:46,218 INFO L93 Difference]: Finished difference Result 2542 states and 4717 transitions. [2025-03-17 11:29:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:29:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-03-17 11:29:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:46,232 INFO L225 Difference]: With dead ends: 2542 [2025-03-17 11:29:46,232 INFO L226 Difference]: Without dead ends: 2542 [2025-03-17 11:29:46,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:29:46,233 INFO L435 NwaCegarLoop]: 2473 mSDtfsCounter, 3764 mSDsluCounter, 3025 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 5498 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:46,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 5498 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 11:29:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-03-17 11:29:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1369. [2025-03-17 11:29:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 860 states have (on average 1.7209302325581395) internal successors, (1480), 1362 states have internal predecessors, (1480), 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 11:29:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2488 transitions. [2025-03-17 11:29:46,412 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2488 transitions. Word has length 152 [2025-03-17 11:29:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:46,413 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2488 transitions. [2025-03-17 11:29:46,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:29:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2488 transitions. [2025-03-17 11:29:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 11:29:46,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:46,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:46,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:29:46,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:46,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1316232771, now seen corresponding path program 1 times [2025-03-17 11:29:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:46,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893849865] [2025-03-17 11:29:46,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:46,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 11:29:46,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 11:29:46,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:46,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:46,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893849865] [2025-03-17 11:29:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893849865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:29:46,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926569120] [2025-03-17 11:29:46,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:29:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:29:46,954 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 11:29:46,956 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 11:29:47,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 11:29:47,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 11:29:47,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:47,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:47,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:29:47,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:29:47,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:29:47,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:29:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:47,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:29:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926569120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:29:47,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:29:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-17 11:29:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198411821] [2025-03-17 11:29:47,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:29:47,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:29:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:47,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:29:47,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:29:47,578 INFO L87 Difference]: Start difference. First operand 1369 states and 2488 transitions. Second operand has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 11:29:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:29:52,354 INFO L93 Difference]: Finished difference Result 4081 states and 7439 transitions. [2025-03-17 11:29:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:29:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2025-03-17 11:29:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:29:52,370 INFO L225 Difference]: With dead ends: 4081 [2025-03-17 11:29:52,370 INFO L226 Difference]: Without dead ends: 4081 [2025-03-17 11:29:52,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:29:52,370 INFO L435 NwaCegarLoop]: 1986 mSDtfsCounter, 8508 mSDsluCounter, 12681 mSDsCounter, 0 mSdLazyCounter, 5430 mSolverCounterSat, 2013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9512 SdHoareTripleChecker+Valid, 14667 SdHoareTripleChecker+Invalid, 7443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2013 IncrementalHoareTripleChecker+Valid, 5430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:29:52,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9512 Valid, 14667 Invalid, 7443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2013 Valid, 5430 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-17 11:29:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2025-03-17 11:29:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 1709. [2025-03-17 11:29:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1196 states have (on average 1.6137123745819397) internal successors, (1930), 1698 states have internal predecessors, (1930), 508 states have call successors, (508), 4 states have call predecessors, (508), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-03-17 11:29:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2944 transitions. [2025-03-17 11:29:52,596 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2944 transitions. Word has length 162 [2025-03-17 11:29:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:29:52,597 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2944 transitions. [2025-03-17 11:29:52,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 11:29:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2944 transitions. [2025-03-17 11:29:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-17 11:29:52,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:29:52,600 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:29:52,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:29:52,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:29:52,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:29:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:29:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 248833799, now seen corresponding path program 1 times [2025-03-17 11:29:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:29:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402150738] [2025-03-17 11:29:52,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:29:52,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-17 11:29:53,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-17 11:29:53,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:53,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:29:55,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402150738] [2025-03-17 11:29:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402150738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:29:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98610773] [2025-03-17 11:29:55,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:29:55,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:29:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:29:55,256 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 11:29:55,257 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 11:29:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-17 11:29:55,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-17 11:29:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:29:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:29:55,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 11:29:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:29:55,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:29:55,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:29:55,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:29:56,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:29:56,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:29:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:56,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:29:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:29:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98610773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:29:56,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:29:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-03-17 11:29:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233534471] [2025-03-17 11:29:56,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:29:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:29:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:29:56,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:29:56,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:29:56,601 INFO L87 Difference]: Start difference. First operand 1709 states and 2944 transitions. Second operand has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 11:30:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:30:09,189 INFO L93 Difference]: Finished difference Result 9383 states and 17187 transitions. [2025-03-17 11:30:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:30:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 384 [2025-03-17 11:30:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:30:09,209 INFO L225 Difference]: With dead ends: 9383 [2025-03-17 11:30:09,209 INFO L226 Difference]: Without dead ends: 9383 [2025-03-17 11:30:09,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:30:09,210 INFO L435 NwaCegarLoop]: 6748 mSDtfsCounter, 23734 mSDsluCounter, 44725 mSDsCounter, 0 mSdLazyCounter, 18360 mSolverCounterSat, 5884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26744 SdHoareTripleChecker+Valid, 51473 SdHoareTripleChecker+Invalid, 24244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5884 IncrementalHoareTripleChecker+Valid, 18360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:30:09,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26744 Valid, 51473 Invalid, 24244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5884 Valid, 18360 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2025-03-17 11:30:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9383 states. [2025-03-17 11:30:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9383 to 2555. [2025-03-17 11:30:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2036 states have (on average 1.5019646365422397) internal successors, (3058), 2538 states have internal predecessors, (3058), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-17 11:30:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4084 transitions. [2025-03-17 11:30:09,752 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4084 transitions. Word has length 384 [2025-03-17 11:30:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:30:09,753 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4084 transitions. [2025-03-17 11:30:09,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 11:30:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4084 transitions. [2025-03-17 11:30:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 11:30:09,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:30:09,765 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:09,779 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 11:30:09,966 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,SelfDestructingSolverStorable9 [2025-03-17 11:30:09,967 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:30:09,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:30:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1431538575, now seen corresponding path program 2 times [2025-03-17 11:30:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:30:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112180298] [2025-03-17 11:30:09,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:30:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:30:10,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 828 statements into 2 equivalence classes. [2025-03-17 11:30:10,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 828 statements. [2025-03-17 11:30:10,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:30:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:30:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 11:30:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:30:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112180298] [2025-03-17 11:30:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112180298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:30:10,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:30:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:30:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316723841] [2025-03-17 11:30:10,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:30:10,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:30:10,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:30:10,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:30:10,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:30:10,427 INFO L87 Difference]: Start difference. First operand 2555 states and 4084 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:30:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:30:10,739 INFO L93 Difference]: Finished difference Result 2595 states and 4139 transitions. [2025-03-17 11:30:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:30:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 828 [2025-03-17 11:30:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:30:10,746 INFO L225 Difference]: With dead ends: 2595 [2025-03-17 11:30:10,747 INFO L226 Difference]: Without dead ends: 2595 [2025-03-17 11:30:10,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:30:10,749 INFO L435 NwaCegarLoop]: 2345 mSDtfsCounter, 80 mSDsluCounter, 9127 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11472 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:30:10,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11472 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:30:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2025-03-17 11:30:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2557. [2025-03-17 11:30:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2038 states have (on average 1.5014720314033365) internal successors, (3060), 2540 states have internal predecessors, (3060), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-17 11:30:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4086 transitions. [2025-03-17 11:30:10,837 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4086 transitions. Word has length 828 [2025-03-17 11:30:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:30:10,838 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4086 transitions. [2025-03-17 11:30:10,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:30:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4086 transitions. [2025-03-17 11:30:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-17 11:30:10,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:30:10,852 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:30:10,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:30:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:30:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -375852732, now seen corresponding path program 1 times [2025-03-17 11:30:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:30:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793913093] [2025-03-17 11:30:10,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:30:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:30:11,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-17 11:30:11,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-17 11:30:11,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:30:11,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:30:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 11:30:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:30:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793913093] [2025-03-17 11:30:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793913093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:30:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:30:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:30:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871751981] [2025-03-17 11:30:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:30:12,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:30:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:30:12,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:30:12,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:30:12,972 INFO L87 Difference]: Start difference. First operand 2557 states and 4086 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:30:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:30:13,263 INFO L93 Difference]: Finished difference Result 2562 states and 4092 transitions. [2025-03-17 11:30:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:30:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 829 [2025-03-17 11:30:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:30:13,273 INFO L225 Difference]: With dead ends: 2562 [2025-03-17 11:30:13,273 INFO L226 Difference]: Without dead ends: 2562 [2025-03-17 11:30:13,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 11:30:13,278 INFO L435 NwaCegarLoop]: 2325 mSDtfsCounter, 14 mSDsluCounter, 9032 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11357 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:30:13,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11357 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:30:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-03-17 11:30:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2561. [2025-03-17 11:30:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2042 states have (on average 1.500979431929481) internal successors, (3065), 2544 states have internal predecessors, (3065), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-17 11:30:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4091 transitions. [2025-03-17 11:30:13,486 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4091 transitions. Word has length 829 [2025-03-17 11:30:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:30:13,487 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 4091 transitions. [2025-03-17 11:30:13,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:30:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4091 transitions. [2025-03-17 11:30:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-17 11:30:13,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:30:13,492 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:13,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:30:13,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:30:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:30:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -867456106, now seen corresponding path program 1 times [2025-03-17 11:30:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:30:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822643737] [2025-03-17 11:30:13,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:30:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:30:13,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-17 11:30:13,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-17 11:30:13,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:30:13,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:30:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 11:30:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:30:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822643737] [2025-03-17 11:30:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822643737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:30:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:30:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:30:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041000927] [2025-03-17 11:30:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:30:15,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:30:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:30:15,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:30:15,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:30:15,337 INFO L87 Difference]: Start difference. First operand 2561 states and 4091 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:30:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:30:15,722 INFO L93 Difference]: Finished difference Result 2572 states and 4104 transitions. [2025-03-17 11:30:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:30:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 830 [2025-03-17 11:30:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:30:15,728 INFO L225 Difference]: With dead ends: 2572 [2025-03-17 11:30:15,728 INFO L226 Difference]: Without dead ends: 2572 [2025-03-17 11:30:15,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:30:15,729 INFO L435 NwaCegarLoop]: 2326 mSDtfsCounter, 31 mSDsluCounter, 15906 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18232 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:30:15,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18232 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:30:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2025-03-17 11:30:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2569. [2025-03-17 11:30:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2552 states have internal predecessors, (3074), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-17 11:30:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4100 transitions. [2025-03-17 11:30:15,830 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4100 transitions. Word has length 830 [2025-03-17 11:30:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:30:15,831 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 4100 transitions. [2025-03-17 11:30:15,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:30:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4100 transitions. [2025-03-17 11:30:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-17 11:30:15,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:30:15,841 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:15,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:30:15,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:30:15,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:30:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -57389166, now seen corresponding path program 1 times [2025-03-17 11:30:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:30:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615597970] [2025-03-17 11:30:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:30:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:30:16,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-17 11:30:16,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-17 11:30:16,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:30:16,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:30:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:30:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:30:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615597970] [2025-03-17 11:30:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615597970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:30:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363358189] [2025-03-17 11:30:23,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:30:23,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:30:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:30:23,144 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 11:30:23,146 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 11:30:23,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-17 11:30:24,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-17 11:30:24,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:30:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:30:24,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 4154 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 11:30:24,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:30:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:30:24,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:25,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 11:30:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:30:25,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:30:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:30:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363358189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:30:25,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:30:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 42 [2025-03-17 11:30:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578461604] [2025-03-17 11:30:25,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:30:25,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 11:30:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:30:25,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 11:30:25,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:30:25,871 INFO L87 Difference]: Start difference. First operand 2569 states and 4100 transitions. Second operand has 42 states, 42 states have (on average 55.23809523809524) internal successors, (2320), 42 states have internal predecessors, (2320), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)