./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:26:11,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:26:11,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:26:11,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:26:11,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:26:11,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:26:11,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:26:11,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:26:11,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:26:11,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:26:11,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:26:11,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:26:11,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:26:11,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:26:11,238 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:26:11,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:26:11,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:26:11,239 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:26:11,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:26:11,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:26:11,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:26:11,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:26:11,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:26:11,242 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 -> 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 [2025-03-08 22:26:11,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:26:11,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:26:11,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:26:11,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:26:11,471 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:26:11,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2025-03-08 22:26:12,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f80c6404/6b5604ebba7842a2a2968490c20930d8/FLAG4f9deaa4f [2025-03-08 22:26:12,958 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:26:12,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2025-03-08 22:26:12,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f80c6404/6b5604ebba7842a2a2968490c20930d8/FLAG4f9deaa4f [2025-03-08 22:26:13,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f80c6404/6b5604ebba7842a2a2968490c20930d8 [2025-03-08 22:26:13,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:26:13,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:26:13,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:26:13,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:26:13,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:26:13,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145e77ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13, skipping insertion in model container [2025-03-08 22:26:13,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:26:13,566 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-08 22:26:13,582 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-08 22:26:13,584 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-08 22:26:13,586 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-08 22:26:13,589 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-08 22:26:13,605 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-08 22:26:13,605 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-08 22:26:13,606 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-08 22:26:13,606 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-08 22:26:13,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:26:13,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:26:13,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:26:13,729 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:26:13,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13 WrapperNode [2025-03-08 22:26:13,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:26:13,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:26:13,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:26:13,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:26:13,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,839 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-03-08 22:26:13,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:26:13,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:26:13,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:26:13,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:26:13,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,916 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 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, 4, 42]. [2025-03-08 22:26:13,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:13,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:14,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:26:14,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:26:14,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:26:14,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:26:14,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (1/1) ... [2025-03-08 22:26:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:26:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:14,035 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-08 22:26:14,037 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-08 22:26:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-08 22:26:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-08 22:26:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:26:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:26:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:26:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 22:26:14,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 22:26:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:26:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:26:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:26:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 22:26:14,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 22:26:14,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 22:26:14,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:26:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:26:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:26:14,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:26:14,211 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:26:14,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:26:16,222 INFO L1307 $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-08 22:26:16,410 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2025-03-08 22:26:16,410 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:26:16,487 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:26:16,487 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 22:26:16,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:26:16 BoogieIcfgContainer [2025-03-08 22:26:16,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:26:16,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:26:16,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:26:16,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:26:16,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:26:13" (1/3) ... [2025-03-08 22:26:16,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118153ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:26:16, skipping insertion in model container [2025-03-08 22:26:16,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:13" (2/3) ... [2025-03-08 22:26:16,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118153ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:26:16, skipping insertion in model container [2025-03-08 22:26:16,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:26:16" (3/3) ... [2025-03-08 22:26:16,499 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-1.i [2025-03-08 22:26:16,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:26:16,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-1.i that has 6 procedures, 1378 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-08 22:26:16,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:26:16,580 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;@8c726b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:26:16,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:26:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 1370 states, 859 states have (on average 1.839348079161816) internal successors, (1580), 1363 states have internal predecessors, (1580), 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-08 22:26:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:26:16,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:16,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:26:16,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1249373015, now seen corresponding path program 1 times [2025-03-08 22:26:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977770379] [2025-03-08 22:26:16,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:16,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:26:16,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:26:16,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:16,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:16,718 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-08 22:26:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977770379] [2025-03-08 22:26:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977770379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:16,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:16,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:26:16,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847593670] [2025-03-08 22:26:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:16,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:26:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:16,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:26:16,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:26:16,746 INFO L87 Difference]: Start difference. First operand has 1370 states, 859 states have (on average 1.839348079161816) internal successors, (1580), 1363 states have internal predecessors, (1580), 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.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:16,899 INFO L93 Difference]: Finished difference Result 1368 states and 2531 transitions. [2025-03-08 22:26:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:26:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:26:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:16,926 INFO L225 Difference]: With dead ends: 1368 [2025-03-08 22:26:16,927 INFO L226 Difference]: Without dead ends: 1366 [2025-03-08 22:26:16,928 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-08 22:26:16,930 INFO L435 NwaCegarLoop]: 2490 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, 2490 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-08 22:26:16,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2490 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-08 22:26:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1366. [2025-03-08 22:26:17,203 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-08 22:26:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2529 transitions. [2025-03-08 22:26:17,218 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2529 transitions. Word has length 7 [2025-03-08 22:26:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2529 transitions. [2025-03-08 22:26:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2529 transitions. [2025-03-08 22:26:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:26:17,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:17,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:26:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:26:17,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2072331228, now seen corresponding path program 1 times [2025-03-08 22:26:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557896170] [2025-03-08 22:26:17,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:17,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:26:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:26:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:26:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557896170] [2025-03-08 22:26:17,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557896170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:17,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:17,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758380442] [2025-03-08 22:26:17,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:17,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:17,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:17,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:17,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:17,366 INFO L87 Difference]: Start difference. First operand 1366 states and 2529 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:18,089 INFO L93 Difference]: Finished difference Result 2715 states and 5042 transitions. [2025-03-08 22:26:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:26:18,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:26:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:18,108 INFO L225 Difference]: With dead ends: 2715 [2025-03-08 22:26:18,108 INFO L226 Difference]: Without dead ends: 2715 [2025-03-08 22:26:18,109 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-08 22:26:18,110 INFO L435 NwaCegarLoop]: 2533 mSDtfsCounter, 1503 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7027 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:18,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7027 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:26:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-08 22:26:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 1368. [2025-03-08 22:26:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 859 states have (on average 1.7729918509895226) internal successors, (1523), 1361 states have internal predecessors, (1523), 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-08 22:26:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2531 transitions. [2025-03-08 22:26:18,358 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2531 transitions. Word has length 9 [2025-03-08 22:26:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:18,358 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2531 transitions. [2025-03-08 22:26:18,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2531 transitions. [2025-03-08 22:26:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 22:26:18,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:18,361 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, 1] [2025-03-08 22:26:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:26:18,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:18,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -231763017, now seen corresponding path program 1 times [2025-03-08 22:26:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:18,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111331266] [2025-03-08 22:26:18,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:18,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 22:26:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 22:26:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:18,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:18,691 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-08 22:26:18,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111331266] [2025-03-08 22:26:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111331266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:18,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:18,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662691557] [2025-03-08 22:26:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:18,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:18,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:18,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:18,693 INFO L87 Difference]: Start difference. First operand 1368 states and 2531 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-08 22:26:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:18,818 INFO L93 Difference]: Finished difference Result 1326 states and 2454 transitions. [2025-03-08 22:26:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:26:18,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-08 22:26:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:18,827 INFO L225 Difference]: With dead ends: 1326 [2025-03-08 22:26:18,827 INFO L226 Difference]: Without dead ends: 1326 [2025-03-08 22:26:18,827 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-08 22:26:18,829 INFO L435 NwaCegarLoop]: 2396 mSDtfsCounter, 30 mSDsluCounter, 4773 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7169 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-08 22:26:18,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7169 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-08 22:26:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2025-03-08 22:26:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 817 states have (on average 1.7698898408812729) internal successors, (1446), 1319 states have internal predecessors, (1446), 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-08 22:26:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2454 transitions. [2025-03-08 22:26:18,914 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2454 transitions. Word has length 83 [2025-03-08 22:26:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2454 transitions. [2025-03-08 22:26:18,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-08 22:26:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2454 transitions. [2025-03-08 22:26:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 22:26:18,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:18,919 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, 1] [2025-03-08 22:26:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:26:18,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash -519529904, now seen corresponding path program 1 times [2025-03-08 22:26:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943647945] [2025-03-08 22:26:18,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:18,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 22:26:18,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 22:26:18,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:18,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:19,107 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-08 22:26:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943647945] [2025-03-08 22:26:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943647945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:26:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888236368] [2025-03-08 22:26:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:26:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:26:19,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:19,110 INFO L87 Difference]: Start difference. First operand 1326 states and 2454 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 22:26:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:19,260 INFO L93 Difference]: Finished difference Result 2549 states and 4775 transitions. [2025-03-08 22:26:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:26:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2025-03-08 22:26:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:19,270 INFO L225 Difference]: With dead ends: 2549 [2025-03-08 22:26:19,270 INFO L226 Difference]: Without dead ends: 2549 [2025-03-08 22:26:19,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:19,271 INFO L435 NwaCegarLoop]: 2599 mSDtfsCounter, 1261 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 4999 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-08 22:26:19,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 4999 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-03-08 22:26:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2545. [2025-03-08 22:26:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1536 states have (on average 1.7994791666666667) internal successors, (2764), 2538 states have internal predecessors, (2764), 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-08 22:26:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4772 transitions. [2025-03-08 22:26:19,467 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4772 transitions. Word has length 83 [2025-03-08 22:26:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:19,467 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4772 transitions. [2025-03-08 22:26:19,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 22:26:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4772 transitions. [2025-03-08 22:26:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 22:26:19,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:19,469 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] [2025-03-08 22:26:19,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:26:19,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:19,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 955413345, now seen corresponding path program 1 times [2025-03-08 22:26:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329863292] [2025-03-08 22:26:19,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:19,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 22:26:19,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 22:26:19,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:19,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:19,806 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-08 22:26:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:19,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329863292] [2025-03-08 22:26:19,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329863292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:19,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:19,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:19,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779391764] [2025-03-08 22:26:19,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:19,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:19,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:19,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:19,808 INFO L87 Difference]: Start difference. First operand 2545 states and 4772 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-08 22:26:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:20,407 INFO L93 Difference]: Finished difference Result 4769 states and 9093 transitions. [2025-03-08 22:26:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:26:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 98 [2025-03-08 22:26:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:20,432 INFO L225 Difference]: With dead ends: 4769 [2025-03-08 22:26:20,432 INFO L226 Difference]: Without dead ends: 4769 [2025-03-08 22:26:20,432 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-08 22:26:20,433 INFO L435 NwaCegarLoop]: 2486 mSDtfsCounter, 1416 mSDsluCounter, 4373 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 6859 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-08 22:26:20,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 6859 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:26:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-03-08 22:26:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 2547. [2025-03-08 22:26:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 1538 states have (on average 1.7984395318595578) internal successors, (2766), 2540 states have internal predecessors, (2766), 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-08 22:26:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 4774 transitions. [2025-03-08 22:26:20,741 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 4774 transitions. Word has length 98 [2025-03-08 22:26:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:20,743 INFO L471 AbstractCegarLoop]: Abstraction has 2547 states and 4774 transitions. [2025-03-08 22:26:20,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-08 22:26:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 4774 transitions. [2025-03-08 22:26:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 22:26:20,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:20,745 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] [2025-03-08 22:26:20,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:26:20,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -803263995, now seen corresponding path program 1 times [2025-03-08 22:26:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:20,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380263354] [2025-03-08 22:26:20,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:26:20,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:26:20,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:20,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:20,933 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-08 22:26:20,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380263354] [2025-03-08 22:26:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380263354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:26:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021259564] [2025-03-08 22:26:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:20,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:26:20,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:20,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:26:20,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:20,935 INFO L87 Difference]: Start difference. First operand 2547 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 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-08 22:26:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:21,038 INFO L93 Difference]: Finished difference Result 2587 states and 4814 transitions. [2025-03-08 22:26:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:26:21,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 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 153 [2025-03-08 22:26:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:21,048 INFO L225 Difference]: With dead ends: 2587 [2025-03-08 22:26:21,049 INFO L226 Difference]: Without dead ends: 2587 [2025-03-08 22:26:21,049 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-08 22:26:21,049 INFO L435 NwaCegarLoop]: 2394 mSDtfsCounter, 8 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4773 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-08 22:26:21,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4773 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-03-08 22:26:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2587. [2025-03-08 22:26:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 1578 states have (on average 1.7782002534854247) internal successors, (2806), 2580 states have internal predecessors, (2806), 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-08 22:26:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 4814 transitions. [2025-03-08 22:26:21,277 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 4814 transitions. Word has length 153 [2025-03-08 22:26:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:21,277 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 4814 transitions. [2025-03-08 22:26:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 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-08 22:26:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 4814 transitions. [2025-03-08 22:26:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 22:26:21,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:21,279 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] [2025-03-08 22:26:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:26:21,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:21,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash 380083302, now seen corresponding path program 1 times [2025-03-08 22:26:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987909817] [2025-03-08 22:26:21,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:21,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:26:21,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:26:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:21,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:21,527 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-08 22:26:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987909817] [2025-03-08 22:26:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987909817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:21,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812317901] [2025-03-08 22:26:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:21,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:21,530 INFO L87 Difference]: Start difference. First operand 2587 states and 4814 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-08 22:26:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:21,635 INFO L93 Difference]: Finished difference Result 2463 states and 4614 transitions. [2025-03-08 22:26:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:26:21,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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 153 [2025-03-08 22:26:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:21,645 INFO L225 Difference]: With dead ends: 2463 [2025-03-08 22:26:21,646 INFO L226 Difference]: Without dead ends: 2463 [2025-03-08 22:26:21,646 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-08 22:26:21,646 INFO L435 NwaCegarLoop]: 2319 mSDtfsCounter, 32 mSDsluCounter, 4624 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6943 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-08 22:26:21,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6943 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-03-08 22:26:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2463. [2025-03-08 22:26:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1454 states have (on average 1.7922971114167814) internal successors, (2606), 2456 states have internal predecessors, (2606), 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-08 22:26:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4614 transitions. [2025-03-08 22:26:21,832 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4614 transitions. Word has length 153 [2025-03-08 22:26:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:21,832 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 4614 transitions. [2025-03-08 22:26:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-08 22:26:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4614 transitions. [2025-03-08 22:26:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 22:26:21,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:21,834 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] [2025-03-08 22:26:21,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:26:21,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 232335743, now seen corresponding path program 1 times [2025-03-08 22:26:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120548104] [2025-03-08 22:26:21,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:21,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:26:21,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:26:21,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:21,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:22,025 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-08 22:26:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120548104] [2025-03-08 22:26:22,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120548104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:22,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:22,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:26:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584167894] [2025-03-08 22:26:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:22,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:26:22,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:22,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:26:22,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:26:22,028 INFO L87 Difference]: Start difference. First operand 2463 states and 4614 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-08 22:26:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:23,381 INFO L93 Difference]: Finished difference Result 2545 states and 4720 transitions. [2025-03-08 22:26:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:26:23,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 153 [2025-03-08 22:26:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:23,399 INFO L225 Difference]: With dead ends: 2545 [2025-03-08 22:26:23,399 INFO L226 Difference]: Without dead ends: 2545 [2025-03-08 22:26:23,399 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-08 22:26:23,400 INFO L435 NwaCegarLoop]: 2474 mSDtfsCounter, 3767 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4268 SdHoareTripleChecker+Valid, 5503 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-08 22:26:23,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4268 Valid, 5503 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 22:26:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2025-03-08 22:26:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1371. [2025-03-08 22:26:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 862 states have (on average 1.7192575406032482) internal successors, (1482), 1364 states have internal predecessors, (1482), 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-08 22:26:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2490 transitions. [2025-03-08 22:26:23,530 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2490 transitions. Word has length 153 [2025-03-08 22:26:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:23,531 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2490 transitions. [2025-03-08 22:26:23,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-08 22:26:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2490 transitions. [2025-03-08 22:26:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 22:26:23,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:23,533 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, 1] [2025-03-08 22:26:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:26:23,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:23,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1037353841, now seen corresponding path program 1 times [2025-03-08 22:26:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:23,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558512449] [2025-03-08 22:26:23,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:23,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:23,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 22:26:23,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 22:26:23,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:23,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:24,083 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-08 22:26:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558512449] [2025-03-08 22:26:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558512449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:26:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438307189] [2025-03-08 22:26:24,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:24,085 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-08 22:26:24,087 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-08 22:26:24,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 22:26:24,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 22:26:24,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:24,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:26:24,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:24,357 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-08 22:26:24,533 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 23 treesize of output 3 [2025-03-08 22:26:24,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 22:26:24,548 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-08 22:26:24,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:26:24,696 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-08 22:26:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438307189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:26:24,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:26:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 22:26:24,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054088288] [2025-03-08 22:26:24,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:26:24,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:26:24,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:24,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:26:24,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:26:24,699 INFO L87 Difference]: Start difference. First operand 1371 states and 2490 transitions. Second operand has 11 states, 11 states have (on average 29.0) internal successors, (319), 11 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-08 22:26:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:28,844 INFO L93 Difference]: Finished difference Result 4085 states and 7443 transitions. [2025-03-08 22:26:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:26:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.0) internal successors, (319), 11 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 163 [2025-03-08 22:26:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:28,857 INFO L225 Difference]: With dead ends: 4085 [2025-03-08 22:26:28,858 INFO L226 Difference]: Without dead ends: 4085 [2025-03-08 22:26:28,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:26:28,858 INFO L435 NwaCegarLoop]: 1863 mSDtfsCounter, 8428 mSDsluCounter, 8326 mSDsCounter, 0 mSdLazyCounter, 3757 mSolverCounterSat, 2011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9432 SdHoareTripleChecker+Valid, 10189 SdHoareTripleChecker+Invalid, 5768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2011 IncrementalHoareTripleChecker+Valid, 3757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:28,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9432 Valid, 10189 Invalid, 5768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2011 Valid, 3757 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 22:26:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2025-03-08 22:26:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 1711. [2025-03-08 22:26:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1198 states have (on average 1.6126878130217028) internal successors, (1932), 1700 states have internal predecessors, (1932), 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-08 22:26:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2946 transitions. [2025-03-08 22:26:29,090 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2946 transitions. Word has length 163 [2025-03-08 22:26:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:29,090 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2946 transitions. [2025-03-08 22:26:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.0) internal successors, (319), 11 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-08 22:26:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2946 transitions. [2025-03-08 22:26:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-08 22:26:29,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:29,094 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, 1] [2025-03-08 22:26:29,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:26:29,294 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-08 22:26:29,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1664015019, now seen corresponding path program 1 times [2025-03-08 22:26:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859816693] [2025-03-08 22:26:29,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:29,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-08 22:26:29,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-08 22:26:29,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:29,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:31,559 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-08 22:26:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:31,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859816693] [2025-03-08 22:26:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859816693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:26:31,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893387990] [2025-03-08 22:26:31,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:31,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:31,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:31,562 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-08 22:26:31,563 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-08 22:26:31,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-08 22:26:32,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-08 22:26:32,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:32,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:32,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:26:32,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:32,065 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-08 22:26:32,214 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 23 treesize of output 3 [2025-03-08 22:26:32,302 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 36 treesize of output 13 [2025-03-08 22:26:32,388 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 36 treesize of output 13 [2025-03-08 22:26:32,478 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 36 treesize of output 13 [2025-03-08 22:26:32,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 22:26:32,491 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-08 22:26:32,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:26:32,953 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-08 22:26:32,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893387990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:26:32,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:26:32,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-03-08 22:26:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058372863] [2025-03-08 22:26:32,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:26:32,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:26:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:32,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:26:32,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:26:32,957 INFO L87 Difference]: Start difference. First operand 1711 states and 2946 transitions. Second operand has 20 states, 20 states have (on average 38.45) internal successors, (769), 20 states have internal predecessors, (769), 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-08 22:26:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:41,485 INFO L93 Difference]: Finished difference Result 9391 states and 17195 transitions. [2025-03-08 22:26:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 22:26:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.45) internal successors, (769), 20 states have internal predecessors, (769), 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 385 [2025-03-08 22:26:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:41,505 INFO L225 Difference]: With dead ends: 9391 [2025-03-08 22:26:41,505 INFO L226 Difference]: Without dead ends: 9391 [2025-03-08 22:26:41,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 761 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:26:41,506 INFO L435 NwaCegarLoop]: 1863 mSDtfsCounter, 24760 mSDsluCounter, 14498 mSDsCounter, 0 mSdLazyCounter, 7158 mSolverCounterSat, 4848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27770 SdHoareTripleChecker+Valid, 16361 SdHoareTripleChecker+Invalid, 12006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4848 IncrementalHoareTripleChecker+Valid, 7158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:41,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27770 Valid, 16361 Invalid, 12006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4848 Valid, 7158 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-03-08 22:26:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9391 states. [2025-03-08 22:26:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9391 to 2557. [2025-03-08 22:26:42,020 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-08 22:26:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4086 transitions. [2025-03-08 22:26:42,025 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4086 transitions. Word has length 385 [2025-03-08 22:26:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4086 transitions. [2025-03-08 22:26:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.45) internal successors, (769), 20 states have internal predecessors, (769), 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-08 22:26:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4086 transitions. [2025-03-08 22:26:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 22:26:42,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:42,039 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-08 22:26:42,050 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-08 22:26:42,239 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-08 22:26:42,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1397609501, now seen corresponding path program 2 times [2025-03-08 22:26:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467346121] [2025-03-08 22:26:42,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:26:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:42,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 829 statements into 2 equivalence classes. [2025-03-08 22:26:42,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 829 statements. [2025-03-08 22:26:42,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:26:42,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:42,753 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-08 22:26:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467346121] [2025-03-08 22:26:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467346121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:26:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489903902] [2025-03-08 22:26:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:26:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:42,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:26:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:26:42,755 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-08 22:26:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:43,079 INFO L93 Difference]: Finished difference Result 2597 states and 4141 transitions. [2025-03-08 22:26:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:26:43,080 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-08 22:26:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:43,086 INFO L225 Difference]: With dead ends: 2597 [2025-03-08 22:26:43,086 INFO L226 Difference]: Without dead ends: 2597 [2025-03-08 22:26:43,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:26:43,088 INFO L435 NwaCegarLoop]: 2347 mSDtfsCounter, 80 mSDsluCounter, 9135 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11482 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-08 22:26:43,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11482 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:26:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-03-08 22:26:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2559. [2025-03-08 22:26:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2040 states have (on average 1.5009803921568627) internal successors, (3062), 2542 states have internal predecessors, (3062), 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-08 22:26:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4088 transitions. [2025-03-08 22:26:43,201 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4088 transitions. Word has length 829 [2025-03-08 22:26:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:43,202 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4088 transitions. [2025-03-08 22:26:43,203 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-08 22:26:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4088 transitions. [2025-03-08 22:26:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-08 22:26:43,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:43,216 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-08 22:26:43,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:26:43,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:43,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1427681895, now seen corresponding path program 1 times [2025-03-08 22:26:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509755583] [2025-03-08 22:26:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:43,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-08 22:26:43,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-08 22:26:43,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:45,715 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-08 22:26:45,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509755583] [2025-03-08 22:26:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509755583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:26:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040507494] [2025-03-08 22:26:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:26:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:45,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:26:45,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:26:45,718 INFO L87 Difference]: Start difference. First operand 2559 states and 4088 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-08 22:26:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:45,988 INFO L93 Difference]: Finished difference Result 2564 states and 4094 transitions. [2025-03-08 22:26:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:26:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-08 22:26:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:45,995 INFO L225 Difference]: With dead ends: 2564 [2025-03-08 22:26:45,995 INFO L226 Difference]: Without dead ends: 2564 [2025-03-08 22:26:45,996 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-08 22:26:45,996 INFO L435 NwaCegarLoop]: 2327 mSDtfsCounter, 14 mSDsluCounter, 9040 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11367 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-08 22:26:45,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11367 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:26:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-08 22:26:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2563. [2025-03-08 22:26:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2044 states have (on average 1.5004892367906066) internal successors, (3067), 2546 states have internal predecessors, (3067), 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-08 22:26:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4093 transitions. [2025-03-08 22:26:46,124 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4093 transitions. Word has length 830 [2025-03-08 22:26:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:46,126 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4093 transitions. [2025-03-08 22:26:46,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-08 22:26:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4093 transitions. [2025-03-08 22:26:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-08 22:26:46,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:46,134 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-08 22:26:46,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:26:46,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 885550340, now seen corresponding path program 1 times [2025-03-08 22:26:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:46,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294638326] [2025-03-08 22:26:46,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:46,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-08 22:26:46,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-08 22:26:46,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:48,075 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-08 22:26:48,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:48,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294638326] [2025-03-08 22:26:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294638326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:26:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532101788] [2025-03-08 22:26:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:48,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:26:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:48,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:26:48,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:26:48,077 INFO L87 Difference]: Start difference. First operand 2563 states and 4093 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-08 22:26:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:48,425 INFO L93 Difference]: Finished difference Result 2574 states and 4106 transitions. [2025-03-08 22:26:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:26:48,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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 831 [2025-03-08 22:26:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:48,432 INFO L225 Difference]: With dead ends: 2574 [2025-03-08 22:26:48,432 INFO L226 Difference]: Without dead ends: 2574 [2025-03-08 22:26:48,433 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-08 22:26:48,433 INFO L435 NwaCegarLoop]: 2328 mSDtfsCounter, 31 mSDsluCounter, 15920 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18248 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-08 22:26:48,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18248 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:26:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2025-03-08 22:26:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2571. [2025-03-08 22:26:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2052 states have (on average 1.4990253411306043) internal successors, (3076), 2554 states have internal predecessors, (3076), 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-08 22:26:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4102 transitions. [2025-03-08 22:26:48,516 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4102 transitions. Word has length 831 [2025-03-08 22:26:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:48,517 INFO L471 AbstractCegarLoop]: Abstraction has 2571 states and 4102 transitions. [2025-03-08 22:26:48,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-08 22:26:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4102 transitions. [2025-03-08 22:26:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-03-08 22:26:48,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:48,523 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, 1] [2025-03-08 22:26:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:26:48,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:48,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash 900808073, now seen corresponding path program 1 times [2025-03-08 22:26:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:26:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145001887] [2025-03-08 22:26:48,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:26:48,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-08 22:26:49,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-08 22:26:49,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:49,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:57,018 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-08 22:26:57,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:26:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145001887] [2025-03-08 22:26:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145001887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:26:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707291737] [2025-03-08 22:26:57,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:57,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:57,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:57,021 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-08 22:26:57,024 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-08 22:26:57,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-08 22:26:58,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-08 22:26:58,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:58,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:58,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 4154 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:26:58,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:58,073 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-08 22:26:58,196 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 23 treesize of output 3 [2025-03-08 22:26:58,269 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 36 treesize of output 13 [2025-03-08 22:26:58,347 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 36 treesize of output 13 [2025-03-08 22:26:58,419 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 36 treesize of output 13 [2025-03-08 22:26:58,495 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 36 treesize of output 13 [2025-03-08 22:26:58,562 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 36 treesize of output 13 [2025-03-08 22:26:58,628 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 36 treesize of output 13 [2025-03-08 22:26:58,707 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 36 treesize of output 13 [2025-03-08 22:26:58,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 22:26:58,840 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 36 treesize of output 13 [2025-03-08 22:26:58,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 22:26:58,848 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-08 22:26:58,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:26:59,719 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-08 22:26:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707291737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:26:59,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:26:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-03-08 22:26:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995684676] [2025-03-08 22:26:59,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:26:59,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 22:26:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:26:59,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 22:26:59,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 22:26:59,723 INFO L87 Difference]: Start difference. First operand 2571 states and 4102 transitions. Second operand has 38 states, 38 states have (on average 44.0) internal successors, (1672), 38 states have internal predecessors, (1672), 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-08 22:27:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:20,871 INFO L93 Difference]: Finished difference Result 17955 states and 32601 transitions. [2025-03-08 22:27:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 22:27:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 44.0) internal successors, (1672), 38 states have internal predecessors, (1672), 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 832 [2025-03-08 22:27:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:20,998 INFO L225 Difference]: With dead ends: 17955 [2025-03-08 22:27:20,998 INFO L226 Difference]: Without dead ends: 17955 [2025-03-08 22:27:20,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1651 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 22:27:21,000 INFO L435 NwaCegarLoop]: 1862 mSDtfsCounter, 43957 mSDsluCounter, 25796 mSDsCounter, 0 mSdLazyCounter, 13437 mSolverCounterSat, 8606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49979 SdHoareTripleChecker+Valid, 27658 SdHoareTripleChecker+Invalid, 22043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8606 IncrementalHoareTripleChecker+Valid, 13437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:21,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49979 Valid, 27658 Invalid, 22043 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8606 Valid, 13437 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2025-03-08 22:27:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17955 states. [2025-03-08 22:27:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17955 to 4263. [2025-03-08 22:27:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3732 states have (on average 1.4287245444801715) internal successors, (5332), 4234 states have internal predecessors, (5332), 526 states have call successors, (526), 4 states have call predecessors, (526), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-08 22:27:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6382 transitions. [2025-03-08 22:27:22,133 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6382 transitions. Word has length 832 [2025-03-08 22:27:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 6382 transitions. [2025-03-08 22:27:22,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 44.0) internal successors, (1672), 38 states have internal predecessors, (1672), 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-08 22:27:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6382 transitions. [2025-03-08 22:27:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2025-03-08 22:27:22,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:22,149 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-08 22:27:22,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:27:22,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:22,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:22,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1954412039, now seen corresponding path program 2 times [2025-03-08 22:27:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:27:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140118168] [2025-03-08 22:27:22,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:27:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:27:22,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1720 statements into 2 equivalence classes. [2025-03-08 22:27:22,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1720 statements. [2025-03-08 22:27:22,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:27:22,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-08 22:27:23,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:27:23,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140118168] [2025-03-08 22:27:23,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140118168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:27:23,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:27:23,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 22:27:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131285394] [2025-03-08 22:27:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:27:23,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:27:23,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:27:23,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:27:23,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:27:23,194 INFO L87 Difference]: Start difference. First operand 4263 states and 6382 transitions. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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-08 22:27:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:23,997 INFO L93 Difference]: Finished difference Result 4299 states and 6438 transitions. [2025-03-08 22:27:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:27:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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 1720 [2025-03-08 22:27:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:24,004 INFO L225 Difference]: With dead ends: 4299 [2025-03-08 22:27:24,004 INFO L226 Difference]: Without dead ends: 4299 [2025-03-08 22:27:24,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:27:24,005 INFO L435 NwaCegarLoop]: 2290 mSDtfsCounter, 47 mSDsluCounter, 33921 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 36211 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:24,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 36211 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:27:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2025-03-08 22:27:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4275. [2025-03-08 22:27:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 3744 states have (on average 1.4286858974358974) internal successors, (5349), 4246 states have internal predecessors, (5349), 526 states have call successors, (526), 4 states have call predecessors, (526), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-08 22:27:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6399 transitions. [2025-03-08 22:27:24,097 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6399 transitions. Word has length 1720 [2025-03-08 22:27:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:24,098 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 6399 transitions. [2025-03-08 22:27:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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-08 22:27:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6399 transitions. [2025-03-08 22:27:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2025-03-08 22:27:24,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:24,114 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-08 22:27:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:27:24,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1668033562, now seen corresponding path program 1 times [2025-03-08 22:27:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:27:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24005523] [2025-03-08 22:27:24,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:27:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:27:24,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1720 statements into 1 equivalence classes. [2025-03-08 22:27:25,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1720 of 1720 statements. [2025-03-08 22:27:25,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:27:25,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-08 22:27:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:27:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24005523] [2025-03-08 22:27:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24005523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:27:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:27:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:27:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213426298] [2025-03-08 22:27:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:27:27,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:27:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:27:27,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:27:27,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:27:27,123 INFO L87 Difference]: Start difference. First operand 4275 states and 6399 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-08 22:27:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:27,278 INFO L93 Difference]: Finished difference Result 4278 states and 6402 transitions. [2025-03-08 22:27:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:27:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 1720 [2025-03-08 22:27:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:27,284 INFO L225 Difference]: With dead ends: 4278 [2025-03-08 22:27:27,284 INFO L226 Difference]: Without dead ends: 4278 [2025-03-08 22:27:27,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:27:27,285 INFO L435 NwaCegarLoop]: 2330 mSDtfsCounter, 8 mSDsluCounter, 6813 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9143 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:27,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9143 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:27:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2025-03-08 22:27:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 4278. [2025-03-08 22:27:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 3747 states have (on average 1.4283426741393115) internal successors, (5352), 4249 states have internal predecessors, (5352), 526 states have call successors, (526), 4 states have call predecessors, (526), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-08 22:27:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 6402 transitions. [2025-03-08 22:27:27,376 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 6402 transitions. Word has length 1720 [2025-03-08 22:27:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:27,376 INFO L471 AbstractCegarLoop]: Abstraction has 4278 states and 6402 transitions. [2025-03-08 22:27:27,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-08 22:27:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 6402 transitions. [2025-03-08 22:27:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1722 [2025-03-08 22:27:27,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:27,442 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-08 22:27:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:27:27,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:27,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash -527607541, now seen corresponding path program 1 times [2025-03-08 22:27:27,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:27:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144192939] [2025-03-08 22:27:27,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:27:27,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:27:27,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1721 statements into 1 equivalence classes. [2025-03-08 22:27:28,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1721 of 1721 statements. [2025-03-08 22:27:28,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:27:28,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat